Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over GF(2q)
DOI10.1007/S10623-006-9028-3zbMATH Open1148.94012OpenAlexW2031739007MaRDI QIDQ2383993FDOQ2383993
Authors: 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
Recommendations
- Reed-Muller codes: projections onto GF(4) and multilevel construction
- Coset codes. II. Binary lattices and related codes
- Augmented Product Codes and Lattices: Reed–Muller Codes and Barnes–Wall Lattices
- Binary multilevel coset codes based on Reed-Muller codes
- Une generalisation de la construction de berman des codes de reed et muller p-aires
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Linear codes (general theory) (94B05) Lattice packing and covering (number-theoretic aspects) (11H31) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cites Work
- On the enumeration of self-dual 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
- Type II codes over F/sub 2/+uF/sub 2/
- Title not available (Why is that?)
- Decoding the Golay codes
- Projections of Binary Linear Codes onto Larger Fields
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
- The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- 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
- Reed-Muller codes: projections onto GF(4) and multilevel construction
- Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors
- Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
Cited In (5)
This page was built for publication: Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383993)
