Fast decoding of non-binary first order Reed-Muller codes
From MaRDI portal
Publication:1919701
DOI10.1007/BF01195535zbMath0858.94027MaRDI QIDQ1919701
Simon N. Litsyn, Alexei Ashikhmin
Publication date: 10 October 1996
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01195535
fast Hadamard transform; minimum distance decoding algorithm; non-binary first order Reed-Muller codes
Related Items
Counting irreducible polynomials over GF(3) with first and third coefficients given, Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one, Fast decoding of non-binary first order Reed-Muller codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast decoding algorithm for first-order Reed-Muller codes
- Fast decoding of non-binary first order Reed-Muller codes
- Majority-logic decoding of generalized Reed-Muller codes
- Optimal soft decision block decoders based on fast Hadamard transform
- Some applications of Good's theorem (Corresp.)
- New generalizations of the Reed-Muller codes--I: Primitive codes
- A Generalization of the Fast Fourier Transform
- On generalized ReedMuller codes and their relatives