Moreover, if 0 admits the (t, i)-design property for every i t, we say that 0 admits the t-design property.
Weight enumerators of self-orthogonal codes
β Scribed by C.L. Mallows; N.J.A. Sloane
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 782 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 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
## Abstract Variableβweight optical orthogonal code (OOC) was introduced by GβC Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this article, new infinite classes of optimal (__u, W__, 1, {1/2, 1/2})βOOCs are obtained for __W__={3, 4}, {3, 5} and {3,