On the Voronoi neighbor ratio for binary linear block codes

DOI10.1109/18.737535MaRDI QIDQ4701230zbMATH OpenOpenAlexFDO

Authors 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

Gaussian channellinear block codesneighbor ratiosoft-decision decodingVoronoi region

Mathematics Subject Classification ID

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

Recommendations

• Voronoi regions for binary linear block codes
• On one extremal property of Hamming halfspaces
• Performance of binary block codes at low signal-to-noise ratios

Cited in

(10)

• 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
• Simple rateless error-correcting codes for fading channels
• The maximum number of minimal codewords in an \([n,k]\)-code
• Voronoi regions for binary linear block codes
• On the minimum number of minimal codewords
• Minimal binary codewords derived from the incidence-matrix approach
• Minimal codewords over finite fields derived from certain graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701230)