On the pseudocodeword weight and parity-check matrix redundancy of linear codes

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 1-6

  Kelley, Christine A ^a   Sridhara, Deepak ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b SEAGATE TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; WEIGHING;

(E ,2E) THEORY; LINEAR CODING; PARITY CHECK MATRIX (PCM);

CYBERNETICS;

EID: 46749129406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313040     Document Type: Conference Paper

References (15)

1. M. Schwartz and A. Vardy. On the stopping distance and the stopping redundancy of codes. In Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 2005.
2. J. Feldman, M. J. Wainwright, D. R. Karger, Using Linear Programming to Decode Binary Linear Codes. IEEE Transactions on Information Theory, 51(3), 954 - 972, Mar. 2005.
3. J. Feldman, Decoding Error-Correcting Codes via Linear Programming Decoding, Ph.D. Thesis, M.I.T., Cambridge, MA, 2003.
4. C. Kelley and D. Sridhara. Pseudocodewords of Tanner graphs. Submitted to IEEE Trans. on Information Theory, June 2005.
5. R. Koetter and P. 0. Vontobel. Graph-covers and iterative decoding of finite length codes. In Proceedings of the IEEE International Symposium on Turbo Codes and Applications, Brest, France, September 2003.
6. R. Koetter, W.-C. W. Li, P.O. Vontobel, and J.L. Walker. Characterizations of pseudo-codewords of LDPC codes. Submitted to Journal on Advances in Mathematics of Communications, Aug. 2006.
7. J. Han and P. H. Siegel. Improved upper bounds on stopping redundancy. IEEE Trans. Inform. Theory, IT-53(1):90-104, Jan. 2007.
8. T. Etzion. On the stopping redundancy of Reed-Muller codes. IEEE Trans. Inform. Theory, IT-52(11):4867-4879, Nov. 2006.
9. S. Laendner, T. Hehn, O. Milenkovic, J. B. Huber. When does one redundant parity-check equation matter? In Proc. qf GLOBECOM, 2006.
10. C. Kelley, D. Sridhara, and J. Rosenthal. Tree-based construction of LDPC codes having good pseudocodeword weights. IEEE Transactions on Information Theory, 53(4), pp. 1460 - 1478, April 2007.
11. H. Tang, J. Xu, S. Lin, and K. A. S. Abdel-Ghaffar. Codes on finite geometries. IEEE Trans. Inform Theory, IT-51(2):572-596, 2005.
12. G. D. Forney, Jr., R. Koetter, F. Kschischang, and A. Reznik. On the effective weights of pseudocodewords for codes defined on graphs with cycles. In B. Marcus and J. Rosenthal, editors, Codes, Systems and Graphical Models, IMA Vol. 123, pages 101-112. Springer-Verlag, 2001.
13. F. J. MacWilliams and N. J. A. Sloane.The Theory of Error-Correcting Codes. Amsterdam, North-Holland, 1978.
14. R. M. Tanner, D. Sridhara, A. Sridharan, D. Costello, Jr., and T. E. Fuja. LDPC block and convolutional codes based on circulant matrices. IEEE Trans. Inform. Theory, IT-50(12):2966-2984, 2004.
15. Z. Liu and D. A. Pados. LDPC codes from generalized polygons. IEEE Trans. Inform Theory, IT-51(11):3890 - 3898, 2005.