✦ LIBER ✦

On the weight hierarchy of the semiprimitive codes

✍ Scribed by Tor Helleseth; P. Vijay Kumar

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 320 KB
Volume: 152
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00234-a

No coin nor oath required. For personal study only.

✦ Synopsis

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 weights of the semiprimitive codes are obtained. We apply the above results to find the generalized Hamming weight of some classes of dual codes of primitive BCH codes with designed distance N + 2 when k/2j is odd.

📜 SIMILAR VOLUMES

The weight hierarchy of the Kasami codes

✍ Tor Helleseth; P Vijay Kumar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 413 KB

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

On the weight hierarchy of codes associa

On the weight hierarchy of codes associated to curves of complete intersection

✍ Lizhong Tang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 589 KB

On the weight enumerator of product code

On the weight enumerator of product codes

✍ L.M.G.M. Tolhuizen; C.P.M.J. Baggen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 381 KB

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

Soft decision decoding using the hierarc

Soft decision decoding using the hierarchy of linear block codes

✍ Tadahiro Sato; Hatsukazu Tanaka 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 2 views

Soft decision decoding is a decoding method which can cut the decoding error probability as compared with hard decision decoding by utilizing the channel measurement information effectively. In this paper, a new soft decision decoding method by which decoding operations can be efficiently carried ou

A note on the existence of perfect const

A note on the existence of perfect constant weight codes

✍ C. Roos 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 174 KB

On the Hamming Weight Enumerators of Sel

On the Hamming Weight Enumerators of Self-Dual Codes over Zk

✍ Masaaki Harada; Manabu Oura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

In this article, we investigate the Hamming weight enumerators of self-dual codes over % O and 9 I . Using invariant theory, we determine a basis for the space of invariants to which the Hamming weight enumerators belong for self-dual codes over % O and 9 I .