Improved upper bounds on stopping redundancy

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 90-104

  Han, Junsheng ^a   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Erasure channel; Iterative decoding; Linear code; Maximum distance separable (MDS) code; Stopping set; Tur n number

Indexed keywords

BLOCK CODES; BOUNDARY CONDITIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); GRAPH THEORY; ITERATIVE METHODS; SET THEORY;

ERASURE CHANNEL; ITERATIVE DECODONG; LINEAR CODE; MAXIMUM DISTANCE SEPARABLE (MDS) CODE; STOPPING SET;

CODES (SYMBOLS);

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

References (35)

1. C. Di, D. Proletti, I. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
2. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
3. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 922-932, Mar. 2006.
4. A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 2.
5. N. Kashyap and A. Vardy, "Stopping sets in codes from designs," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 122.
6. 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.
7. J. H. Weber and K. A. Abdel-Ghaffar, "Stopping set analysis for Hamming codes," in Proc. IEEE ISOC Information Theory Workshop on Coding and Complexity, Rotorua, New Zealand, Aug./Sep. 2005, pp. 244-247.
8. M. Schwartz and A. Vardy, "On the stopping distance and stopping redundancy of codes," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 975-979.
9. T. Etzion, "On the stopping redundancy of Reed-Muller codes," 2005, preprint.
10. 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 give size," IEEE Trans. Inf. Theory, submitted for publication.
11. H. D. L. Hollman, and L. M. G. M. Tolhuizen, "Generating parity check equations for bounded-distance iterative erasure decoding," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 514-517.
12. N. Alon and J. H. Spencer, The Probabilistic Method. New York: Wiley, 1991.
13. H. D. L. Hollmann and L. M. G. M. Tolhuizen, "Generating parity check equations for bounded-distance iterative erasure decoding of even weight codes," in Proc. 27th Symp. Information Theory in the Benelux, Noordwijk, The Netherlands, Jun. 2006, pp. 17-24.
14. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1978.
15. H. D. L. Hollmann and L. M. G. M. Tolhuizen, "Generic erasure correcting sets: Bounds and constructions," J. Combin. Theory Ser. A, vol. 113, no. 8, pp. 1746-1759, Nov. 2006.
16. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
17. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd ed. Reading, MA: Addison-Wesley, 1994.
18. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays. New York: Springer-Verlag, 1999.
19. A. Sidorenko, "Upper bounds for Turán numbers," J. Combin. Theory Ser. A, vol. 77, pp. 134-147, 1997.
20. W. H. Mills and R. C. Mullin, "Coverings and packings," in Contemporary Design Theory, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992, ch. 9, pp. 371-399.
21. W. Mantel, "Vraagstuk XXVIII," Wiskundige Opgaven met de Oplossingen, vol. 10, pp. 60-61, 1907.
22. P. Turán, "Egy gráfelméleti szélsöértékfeladatról," (in Hungarian) Mat. Fiz. Lapok, vol. 48, pp. 436-452, 1941.
23. P. Turán, "An extremal problem in graph theory," in Collected Papers of Paul Turán, P. Erdös, Ed. Budapest, Hungary: Akadémiai Kiadó, 1990, pp. 231-256.
24. G. Ringel, "Extremal problems in the theory of graphs," in Theory of Graphs and Their Applications, M. Fiedler, Ed. Prague: Czechoslovak Acad. Sci., 1964.
25. G. Katona, T. Nemetz, and M. Simonovits, "On a graph problem of Turán," (in Hungarian) Mat. Lapok, vol. 15, pp. 228-238, 1964.
26. F. Chung and R. Graham, Erdös on Graphs - His Legacy of Unsolved Problems. Wellesley, MA: A K Peters, 1998.
27. 3 (n, 4)," J. Combin. Theory Ser. A, vol. 87, pp. 381-389, 1999.
28. D. de Caen, D. L. Kreher, and J. Wiseman, "On constructive upper bounds for the Turán numbers T(n, 2r+1; 2r)," Congr. Numer., vol. 65, pp. 277-280, 1988.
29. A. F. Sidorenko, "Systems of sets that have the T-property," Moscow Univ. Math. Bull., vol. 36, no. 5, pp. 22-26, 1981.
30. A. F. Sidorenko, "The method of quadratic forms and Turán's combinatorial problem," Moscow Univ. Math. Bull., vol. 37, no. 1, pp. 1-5, 1982.
31. D. Applegate, E. M. Rains, and N. J. A. Sloane, "On asymmetric coverings and covering numbers," J. Combin. Des., vol. 11, pp. 218-228, 2003.
32. K. H. Kim and F. W. Roush, "On a problem of Turán," in Studies in Pure Mathematics: To the Memory of Paul Turán, P. Erdös, Ed. Basel, Switzerland: Birkhäuser, 1983, pp. 423-425.
33. V. Rödl, "On a packing and covering problem," Europ. J. Combin., vol. 5, pp. 69-78, 1985.
34. P. Erdös and H. Hanani, "On a limit theorem in combinatorial analysis," Publ. Math. Debrecen, vol. 10, pp. 10-13, 1963.
35. P. Frankl and V. Rödl, "Lower bounds for Turän's problem," Graphs Combin., vol. 1, pp. 213-216, 1985.