Bounded-distance soft decision decoding of binary product codes

Author

Amrani, Ofer ; Be´ery, Y.

Author_Institution

Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel

fYear

2000

fDate

2000

Firstpage

85

Abstract

A two-step sub-optimal algorithm for decoding binary product codes is discussed. This algorithm realizes at least half the minimum Euclidean distance of the code. The fundamental geometric properties associated with the algorithm are investigated, and bounds on the number of nearest neighbors are derived. This investigation also results with an improved algorithm which achieves the minimum effective error coefficient, the number of minimum-weight codewords in the product code

Keywords

binary codes; decoding; error statistics; algorithm; binary product codes; bounded-distance soft decision decoding; code distance; codeword error probability reduction; geometric properties; minimum Euclidean distance; minimum effective error coefficient; minimum-weight codewords; nearest neighbors bounds; two-step sub-optimal algorithm; Algorithm design and analysis; Error correction codes; Euclidean distance; Hamming distance; Iterative algorithms; Iterative decoding; Nearest neighbor searches; Product codes; Termination of employment; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866375

Filename

866375