The aim of this paper is the classi"cation of two-weight irreducible cyclic codes. Using Fourier transforms and Gauss sums, we obtain necessary and su$cient numerical conditions for an irreducible cyclic code to have at most two weights. This gives a uni"ed explanation for all two-weight irreducible
On the weight hierarchy of irreducible cyclic codes
โ Scribed by Marcel van der Vlugt
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 376 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the we
An irreducible cyclic (n, k) code is said to be semiprimitive if n = (2 k -l)/N where N> 2 divides 2 j + 1 for some j ~1. The complete weight hierarchy of the semiprimitive codes is determined when k/2j is odd. In the other cases, when k/2j is even, some partial results on the generalized Hamming we
The Kasami codes is a family of [2 2m --1, 3m, 2 TM 1 \_ 2"-1 ] codes which are well known for their applications to construct sequences with optimal correlation magnitudes. The weight hierarchy of the Kasami codes is completely determined. It is also shown that the chain condition holds for these c