Box and match techniques applied to soft-decision decoding

IEEE Transactions on Information Theory

Volumn 50, Issue 5, 2004, Pages 796-810

  Valembois, Antoine ^a   Fossorier, Marc ^a  

^a University of Hawaii at Manoa   (United States)

Author keywords

Block codes; Maximum likelihood decoding (MLD); Order statistics; Soft decision decoding

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ERRORS; MAXIMUM LIKELIHOOD ESTIMATION;

BOX AND MATCH TECHNIQUES; MAXIMUM LIKELIHOOD DECODING; ORDER STATISTICS; SOFT DECISION DECODING;

DECODING;

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

References (34)

1. J. Stern, "A method for finding codewords of small weight," in Coding Theory and Applications, G. Cohen and J. Wolfmann, Eds. New York: Springer-Verlag, 1989, pp. 106-113.
2. A. Canteaut and F. Chabaud, "A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511," IEEE Trans. Inform. Theory, vol. 44, pp. 367-378, Jan. 1998.
3. I. I. Dumer, "On minimum distance decoding of linear codes," in Proc. 5th Joint Soviet-Swedish Int. Workshop Information Theory, Moscow, Russia, Jan. 1991, pp. 50-52.
4. ____, "Sort-and-match algorithm for soft-decision decoding," IEEE Trans. Inform Theory, vol. 45, pp. 2333-2338, Nov. 1999.
5. ____, "Soft decision decoding using punctured codes," IEEE Trans. Inform Theory, vol. 47, pp. 59-71, Jan. 2001.
6. M. Fossorier and S. Lin, "Soft decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
7. J. Snyders and Y. Be'ery, "Maximum likelihood soft decision decoding of binary block codes and decoders for the Golay codes," IEEE Trans. Inform. Theory, vol. 35, pp. 963-975, Sept. 1989.
8. Y. S. Han, "A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 44, pp. 3091-3096, Nov. 1998.
9. Y. S. Han, C. R. P. Hartmann, and C. C. Chen, "Efficient priority-first search maximum likelihood soft decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523, Sept. 1993.
10. B. G. Dorsch, "A decoding algorithm for binary block codes and J-ary output channels," IEEE Trans. Inform. Theory, vol. IT-20, pp. 391-394, May 1974.
11. G. Battail and J. Fang, "Décodage pondéré optimal des codes linéaires en blocs," Ann. Télécommun., vol. 41, no. 11-12, pp. 580-604, Nov.-Dec. 1986.
12. M. Fossorier and S. Lin, "Computationally efficient soft decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 42, pp. 738-750, May 1996.
13. D. Gazelle and J. Snyders, "Reliability-based code search algorithms for maximum likelihood decoding of block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 239-249, Jan. 1997.
14. Y. S. Han, C. R. P. Hartmann, and K. G. Mehrotra, "Decoding linear block codes using a priority-first search: Performance analysis and suboptimal version," IEEE Trans. Inform. Theory, vol. 44, pp. 1233-1246, May 1998.
15. A. Valembois and M. Fossorier, "A comparison between most reliable basis reprocessing strategies," IEICE Trans. Fundamentals, vol. E85-A, no. 7, pp. 1727-1741, July 2002.
16. R. Lidl and H. Niederreiter, Finite Fields. Cambridge, U.K.: Cambridge Univ. Press, 1983.
17. D. J. Taipale and M. B. Pursley, "An improvement to generalized-minimum-distance decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 167-172, Jan. 1991.
18. A. Valembois, "Décodage, détection et reconnaissance des codes linéaires binaires," Ph.D. dissertation, Univ. Limoges, Limoges, France, 2000.
19. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Labs Tech. J., vol. 38, no. 3, pp. 279-324, May 1959.
20. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding on discrete memoryless channels I," Inform. Contr., vol. 10, no. 1, pp. 65-103, Feb. 1967.
21. A. Valembois and M. Fossorier, "Sphere packing bounds revisited for moderate block lengths," IEEE Trans. Inform. Theory, submitted for publication.
22. M. Fossorier and S. Lin, "Error performance analysis for reliability-based decoding algorithms," IEEE Trans. Inform. Theory, vol. 48, pp. 287-293, Jan. 2002.
23. D. Agrawal and A. Vardy, "Generalized-minimum-distance decoding in Euclidean space: Performance analysis," IEEE Trans. Inform. Theory, vol. 46, pp. 60-83, Jan. 2000.
24. M. Fossorier, "Reliability-based soft-decision decoding with iterative information set reduction," IEEE Trans. Inform. Theory, vol. 48, pp. 3101-3106, Dec 2002.
25. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
26. J. T. Coffey and R. M. Goodman, "Any code of which we cannot think is good," IEEE Trans. Inform. Theory, vol. 36, pp. 1453-1460, Nov. 1990.
27. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
28. A. Barg, "Complexity issues in coding theory," in Handbook of Coding Theory. Amsterdam, The Netherlands: Elsevier, 1998, pp. 649-754.
29. Y. Wu and C. Hadjicostis, "Soft decision decoding of linear block codes using ordered G-space encodings," in Proc. 2001 IEEE Global Telecom. Conf., San Antonio, TX, Nov. 2001.
30. E. L. Blokh and V. V. Zyablov, "Coding of generalized concatenated codes," Probl. Inform. Transm., vol. 10, pp. 218-222, 1974.
31. S. Dolinar, D. Dolinar, and F. Pollara, "Code performance as a function of block size," Jet Propuksion Lab., Pasadena, CA, TMO Progr. Rep. 42-133, 1998.
32. M. Fossorier, "Average and maximum computational complexities for information set decoding of block codes," in Proc. 3rd Asian-European Workshop on Information Theory, Kamogawa, Japan, June 2003, pp. 75-78.
33. M. Fossorier and S. Lin, "Reliability-based information set decoding of binary linear codes," IEICE Trans. Fundamentals, vol. E82-A, pp. 2034-2042, Oct. 1999.
34. M. Fossorier and A. Valembois, "Box and match soft decision decoding of linear block codes with iterative information set reduction," in Proc. 2002 Information Theory Workshop, Bangalore, India, Oct. 2002, pp. 45-48.