Simulation of the Sum-Product Algorithm Using Stratified Sampling
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
High performance non-binary quasi-cyclic LDPC codes on euclidean geometries
IEEE Transactions on Communications
Toward low LDPC-code floors: a case study
IEEE Transactions on Communications
Low-floor decoders for LDPC codes
IEEE Transactions on Communications
IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes: an algebraic construction
IEEE Transactions on Communications
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares
IEEE Transactions on Communications
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 754.90 |
Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs