𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local Weight Enumerators for Binary Self-Dual Codes

✍ Scribed by Udo Ott

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
139 KB
Volume
86
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

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 .

Bounds for Self-Dual Codes Over Z4
Bounds for Self-Dual Codes Over Z4
✍ Eric Rains πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 137 KB

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

The [52, 26, 10] Binary Self-Dual Codes
The [52, 26, 10] Binary Self-Dual Codes with an Automorphism of Order 7
✍ W.Cary Huffman; Vladimir D. Tonchev πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 229 KB

All [52, 26,10] binary self-dual codes with an automorphism of order 7 are enumerated. Up to equivalence, there are 499 such codes. They have two possible weight enumerators, one of which has not previously arisen. 2001 Academic Press 1. INTRODUCTION In [1], Conway and Sloane present an upper bound