Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform

  • Authors:
  • Moon Ho Lee;Yuri L. Borissov

  • Affiliations:
  • -;-

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a fast decoding algorithm for the p-ary first-order Reed-Muller code guaranteeing correction of up to ⌊n/4 sin(p-1/2p π)⌋ errors and having complexity proportional to n log n, where n = pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case.