Not all nearest neighbors are equal in bounded distance decoding

O. Amrani; Y. Beery

doi:10.1109/ISIT.1997.613224

Not all nearest neighbors are equal in bounded distance decoding

O. Amrani, Y. Beery

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Bounded distance soft decoders guarantee correct decoding at least up to half the minimum Euclidean distance of a code, 1/2 d₀. 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 language	English
Title of host publication	Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages	301
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1997.613224
State	Published - 1997
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997

Publication series

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

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	29/06/97 → 4/07/97

Access to Document

10.1109/ISIT.1997.613224

Cite this

@inproceedings{ba5eba0028df473790903ae22052e779,

title = "Not all nearest neighbors are equal in bounded distance decoding",

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.",

author = "O. Amrani and Y. Beery",

year = "1997",

doi = "10.1109/ISIT.1997.613224",

language = "אנגלית",

isbn = "0780339568",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "301",

booktitle = "Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

Amrani, O & Beery, Y 1997, Not all nearest neighbors are equal in bounded distance decoding. in Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997., 613224, IEEE International Symposium on Information Theory - Proceedings, pp. 301, 1997 IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, 29/06/97. https://doi.org/10.1109/ISIT.1997.613224

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 -

Not all nearest neighbors are equal in bounded distance decoding

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this