On the Minimum Distances of Non-Binary Cyclic Codes |
| |
| Authors: | Pascale Charpin Aimo Tietäväinen Victor Zinoviev |
| |
| Affiliation: | (1) INRIA, Codes Domaine de Voluceau-Rocquencourt, BP 105 - 78153, Le Chesnay, France;(2) Department of Mathematics and, TUCS University of Turku, FIN-20014 Turku, Finland;(3) Institute for Problems of Information Transmission of the, Russian Academy of Sciences, Bol'shoi Karetnyi 19 GSP-4, Moscow, 101447, Russia |
| |
| Abstract: | We deal with the minimum distances of q-ary cyclic codes of length qm - 1 generated by products of two distinct minimal polynomials, give a necessary and sufficient condition for the case that the minimum distance is two, show that the minimum distance is at most three if q > 3, and consider also the case q = 3. |
| |
| Keywords: | cyclic code minimum distance non-binary |
| 本文献已被 SpringerLink 等数据库收录！ |
|
