| Abstract: |
| Continuing from a previous work, we present two results for cyclic codes of composite length. The first is to show an effective way of constructing good cyclic codes of composite length. Many numerical examples of optimal cyclic codes of composite length can be obtained in this way. The second is to provide an explicit upper bound on the minimal distance of cyclic codes of composite length in terms of the prime factors of the length. This shows, in particular, that cyclic codes of length dividing a high power of a prime are very rare to be good in terms of the minimal distance. |
|