Fundamentals of Convolutional Coding
Fundamentals of Convolutional Coding
Data Structures and Algorithms
Data Structures and Algorithms
Quasi-cyclic LDPC codes of column-weight two using a search algorithm
EURASIP Journal on Applied Signal Processing
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Tailbiting codes obtained via convolutional codes with large active distance-slopes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices
IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
An algorithm for counting short cycles in bipartite graphs
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We search for good regular quasi-cyclic (QC) LDPC codes with J = 2 ones in each column. In order to simplify the search, QC LDPC codes are represented in the form of tail-biting (TB) convolutional codes. A modified BEAST algorithm is used for finding the free distance (minimum distance) and the girth of both parent convolutional and block LDPC codes. Representations of known bipartite graphs and LDPC based on finite geometries in the form of TB convolutional codes are found. This approach is further generalized for J = 3 QC LDPC codes. Examples of good short LDPC codes with large girth and minimum distance are given. For example, we present a rate 2/5 J = 3 QC LDPC (225, 92)- code with girth 8 and minimum distance 24.