Pseudo-codeword analysis of tanner graphs from projective and Euclidean planes

IEEE Transactions on Information Theory

Volumn 53, Issue 7, 2007, Pages 2376-2393

  Smarandache, Roxana ^a   Vontobel, Pascal O ^b,c,d  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b Wisconsin Electric Machines and Power Electronics Consortium   (United States)

^c Department of Electrical Engineering and Computer Science   (United States)

^d HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Codes from Euclidean planes; Codes from projective planes; Linear programming decoding; Message passing iterative decoding; Minimal codewords; Minimal pseudo codewords; Pseudo weight; Pseudo weight spectra

Indexed keywords

BINARY-INPUT OUTPUT-SYMMETRIC MEMORYLESS CHANNEL; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MINIMAL CODEWORDS; PSEUDO-WEIGHT SPECTRA;

BINARY CODES; GRAPH THEORY; ITERATIVE DECODING; LINEAR PROGRAMMING; MAXIMUM LIKELIHOOD; MESSAGE PASSING;

DATA COMMUNICATION SYSTEMS;

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

References (45)

1. J. Feldman, "Decoding Error-Correcting Codes Via Linear Programming," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
2. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory vol. 51, no. 3, pp. 954-972, Mar. 2005.
3. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. on Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
4. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
5. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 75-82.
6. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," IEEE Trans. Inf. Theory Online. Available: http://www.arxiv.org/abs/cs.IT/0512078, submitted for publication
7. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Int. Symp. Information Theory and its Applications (ISITA), Parma, Italy, Oct. 2004, pp. 991-996.
8. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, Jun. 2000.
9. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
10. L. M. Batten, Combinatorics of Finite Geometries, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1997.
11. J. W. P. Hirschfeld, Projective Geometries over Finite Fields, ser. Oxford Mathematical Monographs, 2nd ed. New York: Clarendon/Oxford Univ. Press, 1998.
12. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
13. E. Agrell, "Voronoi regions for binary linear block codes," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 310-316, Jan. 1996.
14. M. M. Deza and M. Laurent, Geometry of Cuts and Metrics, ser. Algorithms and Combinatorics. Berlin, Germany: Springer-Verlag, 1997, vol. 15.
15. T. Y. Hwang, "Decoding linear block codes for minimizing word error rate," IEEE Trans. Inf. Theory, vol. IT-25, no. 6, pp. 733-737, Nov. 1979.
16. D. Bertsimas and J. N. Tsitsiklis, Linear Optimization. Belmont, MA: Athena Scientific, 1997.
17. J. L. Massey, "Minimal codewords and secret sharing," in Proc. 6th Joint Swedish-Russian Int. Workshop on Information Theory, Mölle, Sweden, Aug. 1993, pp. 276-279.
18. A. Ashikhmin and A. Barg, "Minimal vectors in linear codes," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 2010-2017, Sep. 1998.
19. A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, "Variations on minimal codewords in linear codes," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Paris, 1995) (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 948, pp. 96-105.
20. R. Koetter, W.-C. W. Li, P. O. Vontobel, and J. L.Walker, "Characterizations of pseudo-codewords of LDPC codes," Adv. Math. vol. 213, no. 1, pp. 205-229, Aug. 2007.
21. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
22. G. D. Forney, Jr., R.Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, vol. 123, pp. 101-112.
23. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
24. P. O.Vontobel and R.Koetter, "Lower bounds on the minimum pseudo-weight of linear codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 70.
25. S.-T. Xia and F.-W. Fu, "Minimum pseudo-weight and minimum pseudo-codewords of LDPC codes," IEEE Trans. Inf. Theory Online. Available: http://www.arxiv.org/abs/cs.IT/060605, submitted for publication
26. G. Cohen and A. Lempel, "Linear intersecting codes," Discr. Math vol. 56, pp. 35-43, 1985.
27. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, pp. 113-130.
28. D. Haley and A. Grant, "Improved reversible LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1367-1371.
29. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
30. G. E. Séguin, "A lower bound on the error probability for signals in white Gaussian noise," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 3168-3175, Nov. 1998.
31. D. Avis, "LRS: A revised implementation of the reverse search vertex enumeration algorithm," in Polytopes - Combinatorics and Computation G. Kalai and G. M. Ziegler, Eds. Basel, Switzerland: Birkhäser Verlag, 2000, pp. 177-198 Online.Available: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
32. N. Kashyap and A. Vardy, "Stopping sets in codes from designs," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jul. 2003, p. 122 Online. Available: http://www.mast.queensu.ca/~nkashyap
33. M. Wauer, "LDPC Codes Based on Projective Geometries," Master's thesis, Dept. Math. Statist., San Diego State Univ., San Diego, CA, 2005.
34. R. Smarandache and M. Wauer, "Bounds on the pseudo-weight of minimal pseudo-codewords of projective geometry codes," in Contemporary Mathematics, Algebra and Its Applications, D. V. Huynh, S. K. Jain, and S. R. Lopez-Permouth, Eds. Providence, RI: Amer. Math. Soc., Dec. 2006, vol. 419, pp. 285-296 Online. Available: http://www.arxiv.org/abs/ cs.IT/0510049
35. C. Kelley and D. Sridhara, "Pseudocodewords of Tanner graphs," IEEE Trans. Inf. Theory Online. Available: http://www.arxiv.org/abs/cs.IT/ 0504013, submitted for publication
36. J. Justesen, T. Høholdt, and J. Hjaltason, "Complete ML decoding for the (73,45) PG code," in Proc. 43rd Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sep. 2005, pp. 1076-1086.
37. J. Justesen, T.Høholdt, and J. Hjaltason, "Iterative list decoding," IEEE Trans. Inf. Theory, submitted for publication.
38. S. Laendner and O. Milenkovic, "Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes," in Proc. 2005 Int. Conf. Wireless Networks, Communications, and Mobile Computing (Wirelesscom 2005), Maui, HI, Jun. 2005.
39. T. Høholdt, J. Justesen, and B. Jonsson, "Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 2171-2173.
40. T. Høholdt, Dec. 2005, personal communication.
41. P. O. Vontobel and R. Smarandache, "On minimal pseudo-codewords of Tanner graphs from projective planes," in Proc. 43rd Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sep. 2005, pp. 20-30 Online. Available: http://www.arxiv.org/abs/cs.IT/0510043
42. P. O. Vontobel and R. Koetter, "Bounds on the threshold of linear programming decoding," in Proc. IEEE Inf. Theory Workshop, Punta del Este, Uruguay, Mar. 2006, pp. 175-179 Online. Available: http://www.arxiv.org/abs/cs.IT/0602087
43. M. Zhu and K. M. Chugg, "Lower bounds on stopping distance of linear codes and their applications," in Proc. 43rd Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sep. 2005, pp. 1778-1787.
44. M. Chertkov and M. G. Stepanov, "An efficient pseudo-codeword search algorithm for linear programming decoding of LDPC codes," IEEE Trans. Inf. Theory, Sep. 2006 Online. Available: http://www.arxiv.org/abs/cs.IT/0601113, submitted for publication
45. R. M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 808-821, Feb. 2001.