On the minimum distance of a q-ary image of a qm-ary cyclic code

  • Authors:

  • K. Sakakibara;M. Kasahara

  • Affiliations:

  • Dept. of Syst. Eng., Okayama Prefectural Univ.;-

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

Quantified Score

Hi-index 754.90

Visualization

Abstract

We discuss a lower bound on the minimum distance of a q-ary image of qm-ary cyclic code, based on its concatenated structure due to Jensen (see ibid., vol.31, no.6, p.788-93, 1985) and Seguin (see ibid., vol.41, no.2, p.387-99, 1995). An explicit estimate for the minimum distance of the outer codes, which is analogous to the BCH bound, is derived. Complete lists of the values obtained from the lower hound are given for binary images of 25-ary and 26-ary Reed-Solomon codes