Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\)

DOI10.1007/s10623-006-9028-3zbMath1148.94012MaRDI QIDQ2383993

Amir J. Salomon, Ofer Amrani

Publication date: 20 September 2007

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-006-9028-3

zbMATH Keywords

mapping; finite fields; projection; additive codes; set partition; multistage

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B12: Combined modulation schemes (including trellis codes) in coding theory

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

11H31: Lattice packing and covering (number-theoretic aspects)

Cites Work

• On the enumeration of self-dual codes
• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• Decoding the Golay codes
• Coset codes. I. Introduction and geometrical classification
• Coset codes. II. Binary lattices and related codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
• Projections of Binary Linear Codes onto Larger Fields
• Reed-Muller codes: projections onto GF(4) and multilevel construction
• Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors
• Type II codes over F/sub 2/+uF/sub 2/
• Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
• Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
• Unnamed Item