Title :
On the minimum distance of a q-ary image of a qm-ary cyclic code
Author :
Sakakibara, Katsumi ; Kasahara, Masao
Author_Institution :
Dept. of Syst. Eng., Okayama Prefectural Univ., Japan
fDate :
9/1/1996 12:00:00 AM
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
Keywords :
Reed-Solomon codes; concatenated codes; cyclic codes; Reed-Solomon codes; binary images; concatenated structure; lower bound; minimum distance; outer codes; q-ary image; qm-ary cyclic code; Concatenated codes; Cryptography; Linear code; Reed-Solomon codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
