A new linear programming approach to decoding linear block codes

IEEE Transactions on Information Theory

Volumn 54, Issue 3, 2008, Pages 1061-1072

  Yang, Kai ^a   Wang, Xiaodong ^a   Feldman, Jon ^a,b  

^a Columbia University ^*  (United States)

^b GOOGLE INC   (United States)

Author keywords

Fractional distance; Fundamental polytope; Linear programming (LP) decoding; Message passing decoder; Pseudodistance; Single parity check (SPC) product code

Indexed keywords

ALGORITHMS; BLOCK CODES; DECODING; INTEGER PROGRAMMING; MAXIMUM LIKELIHOOD; MESSAGE PASSING;

FRACTIONAL DISTANCE; FUNDAMENTAL POLYTOPE; SINGLE PARITY-CHECK (SPC) PRODUCT CODE;

LINEAR PROGRAMMING;

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

References (20)

1. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory vol. 51, no. 1, pp. 954-972, Jan. 2005.
2. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Dept. Electr. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, 2003.
3. J. Feldman, D. R. Karger, and M. J. Wainwright, "Using linear programming-based decoding of turbo-like codes and its relation to iterative approaches," in Proc. 40th Annu. Allerton Conf. Commun. Control Comput., Allerton, IL, Oct. 2002, pp. 250-260.
4. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, Sep. 2003, pp. 75-82.
5. 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, submitted for publication.
6. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 2004, pp. 991-996.
7. P. Chaichanavong and P. H. Siegel, "Relaxation bounds on the minimum pseudo-weight of linear block codes," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 805-809.
8. K. Yang, J. Feldman, and X. Wang, "Non-linear programming approaches to decoding low-density parity-check codes," IEEE J. Sel. Areas Commun. vol. 24, no. 8, pp. 1603-1613, Aug. 2006.
9. P. O. Vontobel and R. Koetter, "Toward low-complexity linear-programming decoding," in Proc. 4th Int. Symp. Turbo Codes Related Topics, Munich, Germany, Apr. 2006, pp. 1603-1613.
10. M. H. Taghavi and P. Siegel, "Adaptive linear programming decoding," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 1374-1378.
11. F. R. Kschischang, B. Frey, and H. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
12. M. Chertkov and M. Stepanov, "Pseudo-codeword landscape," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2007, pp. 127-131.
13. R. Smarandache and P. Vontobel, "Pseudocodeword analysis of tanner graphs from projective and euclidean planes," IEEE Trans. Inf. Theory, submitted for publication.
14. W. Cook, W. Cunningham, W. Pulleyblank, and A. Schrijver, Combinatorial Optimization. New York: Wiley, 1998.
15. D. M. Rankin and T. A. Gulliver, "Single parity-check product codes," IEEE Trans. Commun., vol. 49, no. 8, pp. 1354-1362, Aug. 2001.
16. D. M. Rankin, T. A. Gulliver, and D. P. Taylor, "Asymptotic performance of single parity-check product codes," IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2230-2235, Sep. 2003.
17. P. O. Vontobel, R. Smarandache, N. Kiyavash, J. Temsch, and D. Vukobratovic, "On the minimal pseudo-codewords of codes from finite geometries," in Proc. IEEE Int. Symp. Inf. Theory, Sep. 2005, pp. 980-984.
18. D. Bertsimas and J. N. Tsitsiklis, Linear Optimization. Belmont, MA: Athena Scientific, 1997.
19. D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
20. J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the golay codes," IEEE Trans. Inf. Theory, vol. IT-35, no. 5, pp. 963-975, Sep. 1989.