On the minimum distances of non-binary cyclic codes

Authors
Charpin, P Tietavainen, A Zinoviev, V
Citation
P. Charpin et al., On the minimum distances of non-binary cyclic codes, DES CODES C, 17(1-3), 1999, pp. 81-85
Citations number
4
Categorie Soggetti
Computer Science & Engineering
Journal title
DESIGNS CODES AND CRYPTOGRAPHY
ISSN journal
09251022 → ACNP
Volume
17
Issue
1-3
Year of publication
1999
Pages
81 - 85
Database
ISI
SICI code
0925-1022(199909)17:1-3<81:OTMDON>2.0.ZU;2-O
Abstract
We deal with the minimum distances of q-ary cyclic codes of length q(m) - 1 generated by products of two distinct minimal polynomials, give a necessar y and sufficient condition for the case that the minimum distance is two, s how that the minimum distance is at most three if q > 3, and consider also the case q = 3.