Double Cylinder Cycle codes of Arbitrary Girth
نویسندگان
چکیده
A particular class of low-density parity-check codes referred to as cylinder-type BC-LDPC codes is proposed by Gholami and Eesmaeili. In this paper We represent a double cylinder-type parity-check matrix H by a graph called the block-structure graph of H and denoted by BSG(H). Using the properties of BSG(H) we propose some mother matrices with column-weight two such that the rate of corresponding cycle codes are greater tan cycle codes constructed by Gholami with same girth.
منابع مشابه
Convolutional Cylinder-type Block-circulant Cycle Codes
In this paper, we consider a class of column-weight two quasi-cyclic low-density parity check codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. Finally, we show that the free distance of the convolutio...
متن کاملQuasi Cyclic LDPC Codes Based on Finite Set Systems
A finite set system (FSS) is a pair (V,B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a class of Quasi-cyclic lowdensity parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight d...
متن کاملGirth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
A method to construct girth-12 (3,L) quasi-cyclic lowdensity parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of t...
متن کاملTight lower bound of consecutive lengths for QC-LDPC codes with girth twelve
For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of la...
متن کاملType-III LDPC Convolutional Codes
A class of geometrically structured quasi-cyclic low-density paritycheck codes with a cylinder structure graph and girth 12 is considered. The parity-check matrix of such a code consists of blocks of zeros and circulant permutation matrices. A class of convolutional codes is assigned to these codes. The convolutional form generator matrix of these codes is obtained by elementary row and column ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.0804 شماره
صفحات -
تاریخ انتشار 2014