Not all nearest neighbors are equal in bounded distance decoding

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages301
Number of pages1
DOIs
StatePublished - 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97

Fingerprint

Dive into the research topics of 'Not all nearest neighbors are equal in bounded distance decoding'. Together they form a unique fingerprint.

Cite this