Shadow Bounds for Self-Dual Codes

@article{Rains1998ShadowBF,
  title={Shadow Bounds for Self-Dual Codes},
  author={Eric M. Rains},
  journal={IEEE Trans. Inf. Theory},
  year={1998},
  volume={44},
  pages={134-139}
}
  • E. Rains
  • Published 1998
  • Computer Science
  • IEEE Trans. Inf. Theory
Conway and Sloane (1990) have previously given an upper bound on the minimum distance of a singly-even self-dual binary code, using the concept of the shadow of a self-dual code. We improve their bound, finding that the minimum distance of a self-dual binary code of length n is at most 4[n/24]+4, except when n mod 24=22, when the bound is 4[n/24]+6. We also show that a code of length a multiple of 24 meeting the bound cannot be singly-even. The same technique gives similar results for additive… 
New asymptotic bounds for self-dual codes and lattices
  • E. Rains
  • Computer Science
    IEEE Trans. Inf. Theory
  • 2003
We give an independent proof of the Krasikov-Litsyn bound d/n/spl lsim/(1-5/sup -1/4/)/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane
New Extremal Self-dual Codes of Length 36
TLDR
It is shown that there are at least 17 inequivalent extremal binary self-dual codes of parameter  [36, 18, 8], which upgrades the previous known result provided by Conway and Sloane (1990), Harada (1999), and Kim (2001).
EXTREMAL BINARY SELF-DUAL CODES OF LENGTHS 42 AND 44 WITH NEW WEIGHT ENUMERATORS
TLDR
This paper constructs extremal self-dual binary [42, 21, 8] and extremalSelfdual Binary codes whose weight enumerators are not yet known to exist and construction of such codes with putative weight enumerator has been one of the fundamental problems in coding theory.
s-Extremal Additive Codes over GF(4)
TLDR
This paper introduces a concept of s-extremality for additive self-dual codes over F4, gives a bound on the length of these codes with even distance d, and classify them up to minimum distance d = 4.
On the minimal weight of some singly-even codes
  • V. Yorgov
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1999
It is shown that the minimal distance d of a singly-even self-dual [24t+8, 12t+4] code is at most 4t+2 if its shadow contains a weight 4 vector, t is even, and (/sub t//sup 5t/) is odd. It is proved
Optimal double circulant self-dual codes over F4
  • T. Gulliver
  • Computer Science
    IEEE Trans. Inf. Theory
  • 2000
TLDR
Two optimal double circulant self-dual codes over F/sub 4/ have been found for each length n/spl les/40 and the [36,18,12] self- dual code improves the lower bound on the highest minimum weight for a [ 36,18] linear code.
A systematic construction of self-dual codes
TLDR
A new coding construction scheme of block codes using short base codes and permutations that enables the construction of binary self-dual codes is presented and a new unified construction of the five extremal doubly-even self- dual codes is given.
A Search for New Optimal Singly-Even Self-Dual Codes of Length 48
TLDR
This work uses the method for constructing self-dual codes via automorphism of order three to find 102 optimal self- dual singly-even codes of length 48, and uses computer algebra system Magma to construct the codes to compute their weight enumerators and automorphisms groups.
NONEXISTENCE OF SOME EXTREMAL SELF-DUAL CODES
TLDR
This work calculates m's which correspond to the nonexistence of some extremal self-dual binary linear codes and proves that there are inflnitely many such m's.
A note on formally self-dual even codes of length divisible by 8
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
An Upper Bound for Self-Dual Codes
A new upper bound on the minimal distance of self-dual codes
It is shown that the minimal distance d of a binary self-dual code of length n>or=74 is at most 2((n+6)/10). This bound is a consequence of some new conditions on the weight enumerator of a self-dual
A bound for divisible codes
  • H. Ward
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1992
TLDR
A divisible code is a linear code whose word weights have a common divisor larger than one and a simple bound on the dimension of the code in terms of its weight range yields an asymptotic improvement of the Conway-Sloane bound for self-dual codes.
A new upper bound for the minimum of an integral lattice of determinant 1
Let Λ be an n-dimensional integral lattice of determinant 1. We show that, for all sufficiently large n, the minimal nonzero squared length in Λ does not exceed [ ( n + 6 ) /10 ]. This bound is a
The Shadow Theory of Modular and Unimodular Lattices
Abstract It is shown that an n -dimensional unimodular lattice has minimal norm at most 2[ n /24]+2, unless n =23 when the bound must be increased by 1. This result was previously known only for even
Quantum error correction via codes over GF(4)
TLDR
In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
A Course of Modern Analysis
TLDR
The volume now gives a somewhat exhaustive account of the various ramifications of the subject, which are set out in an attractive manner and should become indispensable, not only as a textbook for advanced students, but as a work of reference to those whose aim is to extend the knowledge of analysis.
Extremal and shadow extremal binary self-dual codes
  • preprint.