Binary LinearTime Erasure Decoding for NonBinary LDPC codes

Subject: Computer Science  Information Theoryarxiv: Computer Science::Information Theoryacm: Data_CODINGANDINFORMATIONTHEORY

References
(13)
13 references, page 1 of 2
 1
 2
[1] R. G. Gallager, Low Density Parity Check Codes, Ph.D. thesis, MIT, Cambridge, Mass., September 1960.
[2] T.J. Richardson, M.A. Shokrollahi, and R.L. Urbanke, “Design of capacityapproaching irregular lowdensity paritycheck codes,” IEEE Transactions on Information Theory, vol. 47, pp. 619637, 2001.
[3] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D.A. Spielman, “Efficient erasure correcting codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 569584, 2001.
[4] R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533547, 1981.
[5] E. Paolini, M. Fossorier, and M. Chiani, “Analysis of Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel,” Int. Symp. on Information Theory and its Applications (ISITA), 2006.
[6] N. Miladinovic and M. Fossorier, “Generalized LDPC codes and generalized stopping sets,” IEEE Transactions on Communications, vol. 56(2), pp. 201212, 2008.
[7] M. Luby, “LT codes,” Proc. ACM Symp. Found. Comp. Sci., 2002.
[8] A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, vol. 526, pp. 25512567, 2006.
[9] V. Rathi and R. Urbanke, “Density Evolution, Thresholds and the Stability Condition for Nonbinary LDPC Codes,” IEE Proceedings Communications, vol. 152, no. 6, 2005.
[10] V. Rathi, “Conditional Entropy of NonBinary LDPC Codes over the BEC,” IEEE Int. Symp. on Information Theory (ISIT), 2008.

Metrics
No metrics available

 Download from


Cite this publication