TY - GEN
T1 - Not all nearest neighbors are equal in bounded distance decoding
AU - Amrani, O.
AU - Beery, Y.
PY - 1997
Y1 - 1997
N2 - Bounded distance soft decoders guarantee correct decoding at least up to half the minimum Euclidean distance of a code, 1/2 d0. Under practical working conditions, performance degradation as compared to optimal decoding-is dominated by the behavior of the decoder outside the (bounded distance) hyper-spheres whose centers are the codewords. We carefully investigate this issue and reveal an interesting phenomenon: there are three different types of nearest neighbors classified according to their affect on the decision region. Simulation results are presented to demonstrate this phenomena.
AB - Bounded distance soft decoders guarantee correct decoding at least up to half the minimum Euclidean distance of a code, 1/2 d0. Under practical working conditions, performance degradation as compared to optimal decoding-is dominated by the behavior of the decoder outside the (bounded distance) hyper-spheres whose centers are the codewords. We carefully investigate this issue and reveal an interesting phenomenon: there are three different types of nearest neighbors classified according to their affect on the decision region. Simulation results are presented to demonstrate this phenomena.
UR - http://www.scopus.com/inward/record.url?scp=0030658571&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1997.613224
DO - 10.1109/ISIT.1997.613224
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0030658571
SN - 0780339568
SN - 9780780339569
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 301
BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Y2 - 29 June 1997 through 4 July 1997
ER -