Reed-Muller codes: Projections onto GF(4) and multilevel construction

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2560-2565

  Amrani, Ofer ^a,b   Be'ery, Yair ^a,b  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Mapping; Multilevel; Multistage; Projection; Reed Muller codes

Indexed keywords

MULTILEVEL CONSTRUCTION; MULTISTAGE SOFT DECODING; REED-MULLER CODES;

ALGORITHMS; DECODING; ENCODING (SYMBOLS); MAXIMUM LIKELIHOOD ESTIMATION;

BINARY CODES;

EID: 0035441848     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945270     Document Type: Letter

References (18)

1. Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
2. On representing the Nordstrom-Robinson code over GF (4)
3. Bounded-distance decoding: Algorithms, decision regions, and pseudo nearest neighbors
4. On the enumeration of self-dual codes
5. Coset codes-Part I: Introduction and geometrical classification
6. Coset codes-Part II: Binary lattices and related codes
7. The Nordstrom-Robinson code is the binary image of the Octacode
8. 4 linearity of Kerdock, Preparata, Goethals, and related codes
9. 4-linear for 3 ≤ r ≤ m - 2
10. On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
11. Decoding the Golay codes
12. Near-optimum decoding of product codes: Block turbo codes
13. The Nordstrom-Robinson code: Representation over GF (4) and efficient decoding
14. Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
15. More efficient soft-decision decoding of the Golay codes
16. Two-level decoding of (32,16,8) quadratic residue code