Good Codes Based on Very Sparse Matrices
Proceedings of the 5th IMA Conference on Cryptography and Coding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
On the Minimum Weight of Simple Full-Length Array LDPC Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Low-complexity high-speed decoder design for quasi-cyclic LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Geometrically-structured maximum-girth LDPC block and convolutional codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
On the minimum distance of array codes as LDPC codes
IEEE Transactions on Information Theory
Combinatorial constructions of low-density parity-check codes for iterative decoding
IEEE Transactions on Information Theory
Construction of low-density parity-check codes based on balanced incomplete block designs
IEEE Transactions on Information Theory
On algebraic construction of Gallager and circulant low-density parity-check codes
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
IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes for fast encoding
IEEE Transactions on Information Theory
Low-Density Parity-Check Lattices: Construction and Decoding Analysis
IEEE Transactions on Information Theory
Geometrically-structured maximum-girth LDPC block and convolutional codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Hi-index | 0.00 |
This paper presents a low-complexity recursive and systematic method to construct good well-structured low-density parity-check (LDPC) codes. The method is based on a recursive application of a partial Kronecker product operation on a given γ × q, q ≥ = 3 a prime, integer lattice L(γ × q). The (n - 1)- fold product of L(γ × q) by itself, denoted Ln(γ × q), represents a regular quasi-cyclic (QC) LDPC code, denoted Cγ × qn, of high rate and girth 6. The minimum distance of Cγ × qn is equal to that of the core code Cγ × q1 introduced by L(γ × q). The support of the minimum weight codewords in Cγ × qn are characterized by the support of the same type of codewords in Cγ × q1. From performance perspective the constructed codes compete with the pseudorandom LDPC codes.