TY - JOUR
T1 - Bounded-distance soft decision decoding of binary product codes
AU - Amrani, O.
AU - Be'ery, Y.
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034446840&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0034446840
SN - 2157-8095
SP - 85
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
T2 - 2000 IEEE International Symposium on Information Theory
Y2 - 25 June 2000 through 30 June 2000
ER -