Pseudorandom construction of low-density parity-check codes using linear congruential sequences

IEEE Transactions on Communications

Volumn 50, Issue 9, 2002, Pages 1389-1396

  Prabhakar, Abhiram ^b   Narayanan, Krishna ^a,b  

^a IEEE   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Algebraic construction; Linear congruential sequences; Low density parity check (LDPC) codes

Indexed keywords

GRAPH STRUCTURE; LINEAR CONGRUENTIAL SEQUENCES; LOW DENSITY PARITY CHECK CODES; PARITY CHECK MATRIX; PSEUDORANDOM CONSTRUCTION;

ALGORITHMS; BIT ERROR RATE; CODES (SYMBOLS); COMPUTER SIMULATION; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; THEOREM PROVING;

ENCODING (SYMBOLS);

EID: 0036747163     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2002.802537     Document Type: Article

References (4)

1. G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications. New York: Plenum, 1981.
2. R. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, Jan. 1962.
3. Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-density parity-check matrices based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
4. T. Richardson and R. Urbanke, "Capacity of low-density parity-check codes under message passing decoding," IEEE Trans. Inform. Theory vol. 47, pp. 599-618, Feb. 2001.