A systematic construction of irregular low-density parity-check codes from combinatorial designs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 1-

  Sankaranarayanan, Sundararajan ^a   Vasić, Bane ^a   Kurtas, Erozan M ^b  

^a University of Arizona   (United States)

^b SEAGATE TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; CHANNEL CAPACITY; COMBINATORIAL MATHEMATICS; ENCODING (SYMBOLS); ERROR CORRECTION; LINEAR EQUATIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; OPTIMIZATION; PERFORMANCE; VECTORS;

LINEAR DIOPHANTINE EQUATION; LOW DENSITY PARITY CHECK CODE; PARTITION DISTRIBUTION MATRIX; SHANNON CAPACITY LIMIT;

CODES (SYMBOLS);

EID: 0141904969     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228015     Document Type: Conference Paper

References (3)

1. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
2. J. Colbourn, and J. H. Dinitz, "The handbook of combinatorial designs," Boca, Raton, FL: CRC Press, 1996.
3. Evelyne Contejean and Hervé Devie, "An efficient incremental algorithm for solving systems of linear diophantine equation," Information and Computation, vol. 113, issue 1, pp. 143-172, August 1994.