Voronoi regions for binary linear block codes

DOI10.1109/18.481810zbMath0845.94016OpenAlexW2131058499MaRDI QIDQ4880023

Erik Agrell

Publication date: 15 September 1996

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

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

zbMATH Keywords

BCH codesGaussian channelVoronoi regionssoft-decision decodingblock codeGolay codesGabriel neighbors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Modulation and demodulation in information and communication theory (94A14)

Related Items (7)

Unnamed Item ⋮ 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 non-minimal codewords in binary Reed-Muller codes ⋮ Implementing gradient descent decoding ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph

This page was built for publication: Voronoi regions for binary linear block codes