@article{a6742789b89a46adac1c2a2e3410b28c,
title = "Bounded-distance decoding: Algorithms, decision regions, and pseudo nearest neighbors",
abstract = "For a code C, bounded-distance decoding algorithms perform as optimal algorithms within the balls B(c), centered at the codewords c ∈ C, with radius equal to half the minimum Euclidean distance of the code. Thus distinct bounded-distance algorithms vary in performance due to their different behavior outside the balls B(c). We investigate this issue by analyzing the decision regions of some known (e.g., GMD) and some new bounded-distance algorithms presented in this work. In particular, we show that there are three distinct types of nearest neighbors and classify them according to their influence on the decision region. Simulation results and computer-generated images of the decision regions are provided to illustrate the analytical results.",
keywords = "Bounded-distance decoding, Decision region, Nearest neighbors, Pseudo nearest neighbors, Voronoi region",
author = "Ofer Amrani and Yair Be'ery",
note = "Funding Information: Manuscript received December 2, 1996; revised April 6, 1998. This work was supported in part by the Consortium for Digital Receiver Technologies, the Ministry of Industry and Commerce, Israel. The material in this correspondence was presented in part at the Mediterranean Workshop on Coding and Information Integrity, Mallorca, Spain, February 1996, and the International Symposium on Information Theory, Ulm, Germany, 1997.",
year = "1998",
doi = "10.1109/18.737536",
language = "אנגלית",
volume = "44",
pages = "3072--3082",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",
}