Fast decoding of non-binary first order Reed-Muller codes

DOI10.1007/BF01195535zbMath0858.94027OpenAlexW2093723992MaRDI 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

zbMATH Keywords

fast Hadamard transformminimum distance decoding algorithmnon-binary first order Reed-Muller codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

Fast decoding of non-binary first order Reed-Muller codes ⋮ Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one ⋮ Counting irreducible polynomials over GF(3) with first and third coefficients given

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

This page was built for publication: Fast decoding of non-binary first order Reed-Muller codes