Voronoi regions for binary linear block codes
Journal article, 1996

The Voronoi regions of a block code govern many aspects of the code's performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft-decision decoding. The article presents an efficient method for finding the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi regions. First, it is shown that the question of the Voronoi neighborship can be reduced into testing a simpler relation, called the Gabriel neighborship. Second, a fast method of recognising Gabriel neighbors is proposed. These results are finally employed to describe the Voronoi regions for the Golay codes and several BCH codes, including Hamming codes.



Erik Agrell

Department of Information Theory, Information Theory

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 42 1 310-316

Subject Categories

Computer and Information Science



More information

Latest update