Bounds on the tradeoff between decoding complexity and rate for sparse-graph codes

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 196-201

  Grover, Pulkit ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; BELIEF PROPAGATION (BP) DECODING; BINARY SYMMETRIC CHANNEL (BSC); BOUNDED DEGREES; CODE STRUCTURES; CODES ON GRAPHS; DECODING COMPLEXITIES; GRAPH CODES; INFINITE VARIANCES; LOW-DENSITY GENERATOR MATRIX (LDGM) CODES; LOWER BOUNDS; NECESSARY CONDITIONS; NODE DEGREE; PUNCTURED LOW DENSITY PARITY CHECK (LDPC) CODES;

CHANNEL CAPACITY; CODES (STANDARDS); CODES (SYMBOLS); CONTROL THEORY; CYBERNETICS; GRAPH THEORY; INFORMATION THEORY; MILITARY DATA PROCESSING;

DECODING;

EID: 46749105215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313073     Document Type: Conference Paper

References (17)

1. RG Gallager. Information Theory and Reliable Communication. Wiley, 1968.
2. I Csiszar and JG Komer. Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, Inc., 1982.
3. G.D. Forney. Convolutional codes 3. sequential decoding. Information and Control, 25:267-297, 1974.
4. RG Gallager. Low-Density Parity-Check Codes. PhD thesis, MIT, Cambridge, 1960.
5. A Khandekar. Graph-based codes and Iterative decoding. PhD thesis, California Institute of technology, Pasadena, CA, 2002.
6. A Khandekar and RJ McEliece. On the complexity of reliable communication on the erasure channel. In IEEE International Symposium on Information Theory, 2001.
7. Igal Sason and RL Urbanke. Parity-check density versus performance of binary linear block codes over memoryless symmetric channels. IEEE Transactions on Information Theory, 49(7):1611-1635, July 2003.
8. H Pfister, I Sason, and RL Urbanke. Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity. In IEEE International Symposium on Information Theory, page 209, 2004.
9. CH Hsu and A Anastasopoulos. Capacity-achieving codes with bounded graphical complexity on noisy channels. In Proc. 43th Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, USA, October 2005.
10. Chun-Hao Hsu. Design and Analysis of Capacity-Achieving Codes and Optimal Receivers with Low Complexity. PhD thesis, The University of Michigan, 2006.
11. H. D. Pfister and I. Sason. Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity, submitted to IEEE Transactions on Information Theory, 2005.
12. DJC MacKay. Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45:399-431, March 1999.
13. D Burshtein and G Miller. Bounds on the performance of belief propagation decoding. IEEE Transactions on Information Theory, 48(1):112-122, 2002.
14. O Etesami, M Molkaraie, and MA Shokrollahi. Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5):2033-2051, 2006.
15. TJ Richardson and RL Urbanke. The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding. IEEE Transactions on Information Theory, 47(2):599-618, Feb 2001.
16. D Burshtein, M Krivelevich, S Litsyn, and G Miller. Upper bounds on the rate of LDPC codes. IEEE Transactions on Information Theory, 48(9), September 2002.
17. H Pishro-Nik and F Fekri. Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques. IEEE Transactions on Information Theory, 53(2), Feb 2007.