✦ LIBER ✦

Bounds for Self-Dual Codes Over Z4

✍ Scribed by Eric Rains

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 137 KB
Volume: 6
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1999.0258

No coin nor oath required. For personal study only.

✦ Synopsis

New bounds are given for the minimal Hamming and Lee weights of self-dual codes over 9

. For a self-dual code of length n, the Hamming weight is bounded above by 4[n/24]#f (n mod 24), for an explicitly given function f; the Lee weight is bounded above by 8[n/24]#g(n mod 24), for a di!erent function g. These bounds appear to agree with the full linear programming bound for a wide range of lengths. The proof of these bounds relies on a reduction to a problem of binary codes, namely that of bounding the minimum dual distance of a doubly even binary code.

📜 SIMILAR VOLUMES

Classification of Type IV Self-Dual Z4-C

Classification of Type IV Self-Dual Z4-Codes of Length 16

✍ Masaaki Harada; Akihiro Munemasa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The classi"cation of all self-dual codes over 9 of length up to 15 and Type II codes of length 16 is known. In this note, we give a method to classify Type IV self-dual codes over 9 . As an application, we present the classi"cation of Type IV self-dual codes of length 16. There are exactly 11 inequ

Shadow Codes over Z4

✍ Steven T. Dougherty; Masaaki Harada; Patrick Solé 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 371 KB

The notion of a shadow of a self-dual binary code is generalized to self-dual codes over 9 . A Gleason formula for the symmetrized weight enumerator of the shadow of a Type I code is derived. Congruence properties of the weights follow; this yields constructions of self-dual codes of larger lengths

MDS Self-Dual Codes over Large Prime Fie

MDS Self-Dual Codes over Large Prime Fields

✍ S Georgiou; C Koukouvinos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Combinatorial designs have been used widely in the construction of self-dual codes. Recently a new method of constructing self-dual codes was established using orthogonal designs. This method has led to the construction of many new self-dual codes over small "nite "elds and rings. In this paper, we

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 .

Local Weight Enumerators for Binary Self

Local Weight Enumerators for Binary Self-Dual Codes

✍ Udo Ott 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Moreover, if 0 admits the (t, i)-design property for every i t, we say that 0 admits the t-design property.

Self-dual codes and the (22,8,4) balance

Self-dual codes and the (22,8,4) balanced incomplete block design

✍ R. T. Bilous; G. H. J. van Rees 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract An Erratum has been published for this article in Journal of Combinatorial Designs 14: 83–83, 2006. We enumerate a list of 594 inequivalent binary (33,16) doubly‐even self‐orthogonal codes that have no all‐zero coordinates along with their automorphism groups. It is proven that if a (2