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

Alexey E. Ashikhmin, Simon N. Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

A minimum distance decoding algorithm for non-binary first order Reed-Muller codes is described. Suggested decoding is based on a generalization of the fast Hadamard transform to the non-binary case. We also propose a fast decoding algorithm for non-binary first order Reed-Muller codes with complexity proportional to the length of the code. This algorithm provides decoding within the limits guaranteed by the minimum distance of the code.

Original languageEnglish
Pages (from-to)299-308
Number of pages10
JournalApplicable Algebra in Engineering, Communications and Computing
Volume7
Issue number4
DOIs
StatePublished - 1996

Keywords

  • Fast decoding algorithms
  • Reed-Muller codes

Fingerprint

Dive into the research topics of 'Fast decoding of non-binary first order Reed-Muller codes'. Together they form a unique fingerprint.

Cite this