Box and match soft decision decoding of linear block codes with iterative information set reduction

Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Volumn , Issue , 2002, Pages 45-48

  Fossorier, Marc ^a   Valembois, Antoine ^a  

^a University of Hawaii at Manoa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; CODES (SYMBOLS); DECODING; ECONOMIC AND SOCIAL EFFECTS; INFORMATION THEORY; ITERATIVE METHODS;

AVERAGE COMPLEXITY; BINARY LINEAR BLOCK CODES; DECODING COMPLEXITY; ERROR PERFORMANCE; LINEAR BLOCK CODE; MATCHING TECHNIQUES; ORDER STATISTICS; SOFT DECISION DECODING;

ITERATIVE DECODING;

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

References (16)

1. 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.
2. B. G, Dorsch, "A Decoding Algorithm for Binary Block Codes and J-ary Output Channels," IEEE Trans. Inform. Theory, vol. 20, No 3, pp. 391-394, May 1974.
3. G. Battail, and J. Fang, "Décodage Pondéré Optimal des Codes Linéairea en Blocs", Annales des Télécommunications, vol. 41, n. 11-12,=20 pp. 580-604, Nov.-Dec. 1986.
4. 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.
5. A. Valembois and M. Fossorier, "A Comparison between Most Reliable Basis Reprocessing Strategies," to appear in IEIGE Trans, on Fundam..
6. M. Fossorier, 'Reliability-Based Soft Decision Decoding with Iterative Information Set Reduction," IEEE Trans. Inform. Theory, to appear, vol.48, Dec. 2002.
7. A. Valembois and M. Fossorier, "Box and Match Techniques Applied to Soft-Decision Decoding," The Proc. IEEE Int. Symp, Inform. Theory, Lausanne, Switzerland, June 2002, and submitted to IEEE Trans, on Inform. Theory, April 2002.
8. J. Stern, "A Method for Finding Codewords of Small Weight," The Proceedings Coding Theory and Applications (Toulon, 1988), Lecture Notes in Computer Science, vol. 388, pp 106-113, Springer Verlag, 1989.
9. 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 5U," IEEE Trans Inform. Theory, vol. 44, No 1, pp. 367-378, Jan. 1998.
10. I. I. Dumer, "Sort-and-Match Algorithm for Soft Decision Decoding," IEEE Trans, Inform. Theory, vol. 45, No 7, pp. 2333-2338, Nov. 1999.
11. L I. Dumer, "Soft Decision Decoding using Punctured Codes" , IEEE Tram. Inform Theory, vol. 47, no. 1, pp. 59-71, Jan. 2001.
12. G. Poltyrev, "Bounds on the Decoding Error Probability of Binary Linear Codes via their Spectra", IEEE Trans. Inform. Theory, vol. 40, No 4, pp. 1284-1292, July 1994.
13. 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.
14. M. Fossorier and S. Lin, "Error Performance Analysis for Reliability-Based Decoding Algorithms," IEEE Trans. Inform. Theory, vol.48, pp. 287-293, Jan. 2002.
15. C E. Shannon, "Probability of Error for Optímal Codes in a Gaussian Channel", The Bell Labs Technical Journal, vol. 38, No. 3, pp. 279-324, May 1959.
16. E. L. Blokh and V. V. Zyablov, "Coding of Generalized Concatenated Codes," Probl. Inform. Transm., vol. 10, pp. 2l8-222, 1974.