Voronoi regions for binary linear block codes

DOI10.1109/18.481810MaRDI QIDQ4880023zbMATH OpenOpenAlexFDO

Authors 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 codesblock codeGabriel neighborsGaussian channelGolay codessoft-decision decodingVoronoi regions

Mathematics Subject Classification ID

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

Recommendations

• On the Voronoi neighbor ratio for binary linear block codes
• Multidimensional constellations. II. Voronoi constellations
• On one extremal property of Hamming halfspaces
• Near-ellipsoidal voronoi coding

Cited in

(12)

• Implementing gradient descent decoding
• On the non-minimal codewords in binary Reed-Muller codes
• On the maximum number of minimal codewords
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• On the non-minimal codewords of weight \(2d_{\min}\) in the binary Reed-Muller code
• Near-ellipsoidal voronoi coding
• The maximum number of minimal codewords in an \([n,k]\)-code
• On the Voronoi neighbor ratio 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
• One type of finitely generated minimal linear code over the ring \(Z_{2n}\)

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

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