On the Voronoi neighbor ratio for binary linear block codes

DOI10.1109/18.737535zbMath0936.94020OpenAlexW2166616228MaRDI QIDQ4701230

Erik Agrell

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://research.chalmers.se/en/publication/16142

zbMATH Keywords

linear block codesGaussian channelsoft-decision decodingVoronoi regionneighbor ratio

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Decoding (94B35) Modulation and demodulation in information and communication theory (94A14)

Related Items (7)

Simple rateless error-correcting codes for fading channels ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ On the minimum number of minimal codewords ⋮ On the maximum number of minimal codewords ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]

This page was built for publication: On the Voronoi neighbor ratio for binary linear block codes