Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps

  • Authors:

  • F. Javier Galán-Simón;Edgar Martínez-Moro;Juan Tena Ayuso

  • Affiliations:

  • -;-;-

  • Venue:
  • Proceedings of the 8th IMA International Conference on Cryptography and Coding
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalize to any base r ≥ 2 the Majority-Logic-Decodification Algorithms already considered for r = 2 by Chin-Long Chen, Robert T. Chien and Chao-Kai Liu [2]. The codes considered are generated by Φn(r) where Φn(x) is the nth-cyclotomic polynomial associated to the polynomial xn - 1. Hong Decodification Algorithm [7] is also applicable to these codes, but achieves quite higher computational complexity.