✦ LIBER ✦

On the weight enumerator of product codes

✍ Scribed by L.M.G.M. Tolhuizen; C.P.M.J. Baggen

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 381 KB
Volume: 106-107
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90579-5

No coin nor oath required. For personal study only.

✦ Synopsis

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 not completely determined by the weight enumerator of its constitutent codes.

📜 SIMILAR VOLUMES

Weight enumerators of self-orthogonal co

Weight enumerators of self-orthogonal codes

✍ C.L. Mallows; N.J.A. Sloane 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 782 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 .

The input–output weight enumeration of b

The input–output weight enumeration of binary Hamming codes

✍ Loskot, Pavel ;Beaulieu, Norman C. 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

On the weight hierarchy of the semiprimi

On the weight hierarchy of the semiprimitive codes

✍ Tor Helleseth; P. Vijay Kumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 320 KB

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 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

Coding in the Partial Order of Enumerabl

Coding in the Partial Order of Enumerable Sets

✍ Leo Harrington; André Nies 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 489 KB

We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat