On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 922-932

  Schwartz, Moshe ^a,b,c   Vardy, Alexander ^a,b,d,e  

^a IEEE

^b UNIVERSITY OF CALIFORNIA   (United States)

^c California Institute of Technology   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Erasure channels; Golay codes; Iterative decoding; Linear codes; Maximum distance separable (MDS) codes; Reed Muller codes; Stopping sets

Indexed keywords

ERASURE CHANNELS; GOLAY CODES; LINEAR CODES; MAXIMUM DISTANCE SEPARABLE (MDS) CODES; REED-MULLER CODES; STOPPING SETS;

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; ITERATIVE DECODING; PARAMETER ESTIMATION; REDUNDANCY;

BINARY CODES;

EID: 33748448633     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.864441     Document Type: Article

References (24)

1. N. Alon, E. Fachini, and J. Kömer, "Locally thin set families," Comb., Probab., Comput., vol. 9, pp. 481-488, Nov. 2000.
2. N. Alon, J. Körner, and A. Monti, "String quartets in binary," Comb, Probab., Computing, vol. 9, pp. 381-390, Sep. 2000.
3. A. R. Calderbank, G. D. Forney Jr., and A. Vardy, "Minimal tail-biting trellises: The Golay code and more," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1435-1455, Jul. 1999.
4. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1993.
5. _, "Orbit and coset analysis of the golay and related codes," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1038-1050, Sep. 1990.
6. D. de Caen, "Extension of a theorem of Moon and Moser on complete subgraphs," Ars Comb., vol. 16, pp. 5-10, 1983.
7. C. Di, D. Proietti, İ. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
8. T. Etzion, "On the stopping redundancy of Reed-Muller codes," preprint, Oct. 2005.
9. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, MIT, Cambridge, MA, Sep. 2003.
10. D. Gordon, G. Kuperberg, and O. Patashnik, "New constructions for covering designs," J. Comb. Des., vol. 3, pp. 269-284, 1995.
11. D. Gordon, G. Kuperberg, O. Patashnik, and J. Spencer, "Asymptotically optimal covering designs," J. Comb. Theory, vol. 75, pp. 270-280, 1996.
12. R. L. Graham and N. J. A. Sloane, "Lower bounds for constant weight codes." IEEE Trans. Inf. Theory, vol. IT-26, no. 1, pp. 37-43, Jan. 1980.
13. J. Han and P. H. Siegel, "Improved upper bounds on stopping redundancy," IEEE Trans. Inf. Theory, submitted for publication.
14. N. Kashyap and A. Vardy, "Stopping sets in codes from designs," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 1222.
15. A. Kostochka, "Extremal problems on delta-systems," in Numbers, Information and Complexity. Boston, MA: Kluwer, 2000, pp. 143-150.
16. F. J. MacWilliams, N. J. A. Sloane, and J. G. Thompson, "Good self-dual codes exist," Discr. Math., vol. 3, pp. 153-162, 1972.
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1978.
18. W. H. Mills and R. C. Mullin, "Coverings and packings," in Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992, pp. 371-399.
19. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
20. N. Santhi and A. Vardy, "On the effect of parity-check weights in iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL. Jun/Jul. 2004. p. 322.
21. J. Schönheim, "On coverings," Pacific J. Math., vol. 14, pp. 1405-1411, 1964.
22. A. Sidorenko, "Upper bounds for Turán numbers," J. Combin. Theory, Ser. A, vol. 77. pp. 134-147, 1997.
23. A. Vardy, "Trellis structure of codes," in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, ch. 24.
24. J. S. Yedidia, J. Chen, and M. Fossorier, "Generating code representations suitable for belief propagation decoding," in Proc. 40th Allerton Conf. Communications, Control, and Computing, Monticello, IL., Oct. 2002.