On weights in duadic codes
โ Scribed by Vera Pless; John Myron Masley; Jeffrey S Leon
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 736 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized H
We introduce and characterize triple-sum-sets which are a natural generalization of partial difference sets. The perfect 3-error-correcting Golay code and uniformly packed 2-errorcorrecting codes are then related to triple-sum-sets and a construction is used to obtain 'large' coset leaders of the fi
The number of words of weight w in the product code of linear codes with minimum distances d, and d, is expressed in the number of low weight words of the constituent codes, provided that w <d,d, + max(d,, d<). By examples it is shown that, in general, the full weight enumerator of a product code is
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