The q-ary image of some qm-ary cyclic codes: permutation group and soft-decision decoding

  • Authors:

  • J. Lacan;E. Delpeyroux

  • Affiliations:

  • Departement de Mathematiques Appliquees et d'Informatique, ENSICA, Toulouse;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

Abstract

Using a particular construction of generator matrices of the q-ary image of qm-ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups. The equivalence of such codes with some two-dimensional (2-D) Abelian codes and cyclic codes is deduced from this property. These permutations are also used in the area of the soft-decision decoding of some expanded Reed-Solomon (RS) codes to improve the performance of generalized minimum-distance decoding