• DocumentCode
    1458503
  • Title

    On the Voronoi neighbor ratio for binary linear block codes

  • Author

    Agrell, Erik

  • Author_Institution
    Dept. of Inf. Theory, Chalmers Univ. of Technol., Goteborg, Sweden
  • Volume
    44
  • Issue
    7
  • fYear
    1998
  • fDate
    11/1/1998 12:00:00 AM
  • Firstpage
    3064
  • Lastpage
    3072
  • Abstract
    Soft-decision decoding of block codes is regarded as the geometrical problem of identifying the Voronoi region within which a given input vector lies. A measure, called the neighbor ratio, is proposed to characterize how many facets a Voronoi region has. Theory and algorithms are presented to determine the neighbor ratio for binary linear block codes and results are given for several types of codes. An asymptotic analysis for long codes reveals that the neighbor ratio depends on whether the code rate is less than 1/2 or not. For rates below this threshold, all pairs of codewords tend to share a Voronoi facet; for higher rates, a relatively small fraction of them do
  • Keywords
    binary codes; block codes; computational geometry; decoding; linear codes; Voronoi facet; Voronoi neighbor ratio; Voronoi region; asymptotic analysis; binary linear block codes; code rate; long codes; soft-decision decoding; Additive white noise; Block codes; Decoding; Demodulation; Euclidean distance; Gaussian channels; Gaussian noise; Information theory; Space technology; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.737535
  • Filename
    737535