Deterministic constructions for large girth protograph LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 1680-1684

  Pradhan, Asit Kumar ^a   Subramanian, Arunkumar ^b   Thangaraj, Andrew ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b Link A Media Devices Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ERASURE CHANNEL; BIT ERROR PROBABILITY; DENSITY EVOLUTION; LOW-DENSITY PARITY-CHECK (LDPC) CODES; NUMBER OF ITERATIONS; PROTOGRAPH LDPC CODES; STRONG SECRECIES; WIRE-TAP CHANNELS;

INFORMATION THEORY;

EID: 84890353196     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620513     Document Type: Conference Paper

References (15)

1. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, 2008.
2. E. Ar?kan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels, " IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
3. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC, " IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
4. M. Lentmaier, D. Truhachev, K. Zigangirov, and D. Costello, "An analysis of the block error probability performance of iterative decoding, " IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3834-3855, Nov. 2005.
5. H. Jin and T. Richardson, "Block error iterative decoding capacity for LDPC codes, " in Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on, Sep. 2005, pp. 52-56.
6. J. Thrope, "Low-density parity-check (LDPC) codes constructed from protographs, " INP progress report, vol. 53, no. 8, pp. 42-154, Aug. 2005.
7. D. Divsalar, S. Dolinar, C. Jones, and K. Andrews, " Capacityapproaching protograph codes, " IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 876-888, Aug. 2009.
8. R. Gallager, "Low-density parity-check codes, " Ph. D. dissertation, Massachusetts Institute of Technology, 1963.
9. G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory and Ramanujan Graphs (London Mathematical Society Student Texts). Cambridge University Press, 2003.
10. J. Rosenthal and P. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis, " in Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on, 2001, p. 4.
11. A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, "Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes, " Information Forensics and Security, IEEE Transactions on, vol. 6, no. 3, pp. 585-594, Sep. 2011.
12. T. Richardson and R. Urbanke, "Multi-edge type LDPC codes, " Apr. 2004, unpublished. [Online]. Available: http://citeseerx. ist. psu. edu/viewdoc/summary?doi=10. 1. 1. 106. 7310
13. B. Bollob́as, Extremal Graph Theory. Dover Publications, 2004.
14. A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution, " in Information Theory, 2000. Proceedings. IEEE International Symposium on, 2000, p. 5.
15. R. Storn and K. Price, "Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces, " Journal of Global Optimization, vol. 11, pp. 341-359, 1997.