Permutation decoding and the stopping redundancy hierarchy of linear block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2926-2930

  Hehn, Thorsten ^a   Milenkovic, Olgica ^b   Laendner, Stefan ^b   Huber, Johannes B ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b University of Colorado   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISMS; PARITY-CHECK MATRICES; STOPPING SETS;

BLOCK CODES; CHANNEL CODING; CODES (SYMBOLS); CYBERNETICS; DIESEL ENGINES; ERROR CORRECTION; INFORMATION THEORY; MATRIX ALGEBRA; MESSAGE PASSING; QUALITY ASSURANCE; REDUNDANCY; RELIABILITY; SET THEORY; TECHNICAL PRESENTATIONS;

ITERATIVE DECODING;

EID: 41949126637     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557193     Document Type: Conference Paper

References (12)

1. C. Di, D. Proletti, I. Telatar, T. Richardson, and R. Urbanke. Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. on Inform. Theory, 48(6): 1570-1579, June 2002.
2. M. Schwartz and A. Vardy. On the stopping distance and stopping redundancy of codes. IEEE Trans. on Inform. Theory, 52(3):922-932, March 2006.
3. K.A.S. Abdel-Ghaffar and J.H. Weber. Complete enumeration of stopping sets of full-rank parity-check matrices of hamming codes. submitted to IEEE Trans. on Inform. Theory, March 2006.
4. J. Han and P. Siegel. Improved upper bounds on stopping redundancy. IEEE Trans. on Inform. Theory, 53(1):90-104, January 2007.
5. T. Hehn, S. Laendner, O. Milenkovic, and J. B. Huber. The stopping redundancy hierarchy of cyclic codes. In Proceedings of the 44th Annual Alterton Conference on Communication, Control and Computing, 2006.
6. H.D.L. Hollmann and L.M.G.M. Tolhuizen. On parity-check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size. IEEE Trans. on Inform. Theory, 53(2):823-828, February 2007.
7. F.J. MacWilliams and N.J. Sloane. The Theory of Error-Correcting Codes. North-Holland Publishing Company, 1977.
8. T.R. Halford and K.M. Chugg. Random redundant soft-in soft-out decoding of linear block codes. In Proceedings of Int. Symp. on Inform. Theory (ISIT), pages 2230-2234, Seattle, WA, July 2006.
9. J.D. Key. Some recent developments in permutation decoding. [Online]. Available at http://www.ces.clemson.edu/∼keyj/Key/Cork06.pdf, 2006.
10. J. Wolfmann. A permutation decoding of the (24,12,8) golay code. IEEE Trans. on Inform. Theory, 29(5):748-750, September 1983.
11. T. Hehn, O. Milenkovic, S. Laendner, and J.B. Huber. Permutation decoding and the stopping redundancy hierarchy. Preprint, 2007.
12. J. Schoenheim. On coverings. Pacific J. Math, 14(4): 1405-1411, 1964.