New Binary Singly Even Self-Dual Codes

@article{Harada2010NewBS,
  title={New Binary Singly Even Self-Dual Codes},
  author={Masaaki Harada and Michael Kiermaier and Alfred Wassermann and Radinka Yorgova},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={1612-1617}
}
In this paper, we construct new binary singly even self-dual codes with larger minimum weights than the previously known singly even self-dual codes for several lengths. Several known construction methods are used to construct the new self-dual codes. 

Figures and Tables from this paper

Eighth Power Residue Double Circulant Self-Dual Codes
TLDR
New constructions of self-dual codes over GF(2) and GF(4) by eighth power residues are given, including multiple pure double circulant codes and bordered double circULant codes.
New binary self-dual codes of lengths 56, 62, 78, 92 and 94 from a bordered construction
TLDR
Using a new bordered construction for self-dual codes which employs λ-circulant matrices, this paper constructs many binary self- dual codes of lengths 56, 62, 78, 92 and 94 with parameters in their weight enumerators that were not known in the literature before.
The search of Type I codes
TLDR
The purpose of this paper is to investigate interesting properties of Type I codes of different lengths, and to build up a computer-based code-searching program based on knowledge about Type I code.
Fourth Power Residue Double Circulant Self-Dual Codes
  • Tao Zhang, G. Ge
  • Computer Science
    IEEE Transactions on Information Theory
  • 2015
TLDR
New infinite families of self-dual codes over GF(2, GF(3), GF(4),GF(8), and GF(9) are introduced and some of them have better minimum weight than previously known codes.
Singly even self-dual codes of length 24k + 10 and minimum weight 4k + 2
  • M. Harada
  • Computer Science
    Cryptography and Communications
  • 2018
TLDR
Some restrictions on the possible weight enumerators of singly even self-dual [24k + 10, 12k + 5, 4k + 2] codes with shadows of minimum weight at least 5 for k = 2, 3, 4, 5 are given.
Double-circulant and bordered-double-circulant constructions for self-dual codes over R2
TLDR
Using these methods, three extremal binary Type I codes of length $64$ of new weight enumerators for which extremal codes were not known to exist are constructed.
Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours
TLDR
This work defines a modification of a bordered construction for self-dual codes which utilises <inline-formula><tex-math id="M1">-circulant matrices and provides the necessary conditions for the construction to produce self- dual codes over finite commutative Frobenius rings of characteristic 2.
On extremal double circulant self-dual codes of lengths 90–96
  • T. Gulliver, M. Harada
  • Computer Science, Mathematics
    Applicable Algebra in Engineering, Communication and Computing
  • 2019
TLDR
A classification of extremal double circulant self-dual codes of lengths up to 88 is known and this classification is extended to length 96, where it is demonstrated that no doublecirculantSelfdual [90, 45, 14] code has an extremal self- dual neighbor.
On the self-dual codes invariant under an automorphism of type 11-(8,0)
  • Nikolay I. Yankov
  • Computer Science
    2020 Algebraic and Combinatorial Coding Theory (ACCT)
  • 2020
TLDR
It is proved that [8],[4] SD codes over F210 such that their preimage is a binary code with minimum weight 20 does not exist, and many new Hermitian self-dual codes are found, allowing us to constructed 468062 new binary SD [88,44,16] doubly-even codes.
Extremal binary self-dual codes of lengths 64 and 66 from four-circulant constructions over F2+uF2
TLDR
Five codes are new codes in the sense that codes with these weight enumerators are constructed for the first time and have the values = 1; 30; 34; 84; 94 in W66;1.
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
An extremal singly even self-dual code of length 88
TLDR
Some optimal (extremal) singly even self-dual codes with weight enumerators which were not known to be attainable are also found for lengths 68 and 92.
Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices
TLDR
This approach regenerates all the known extremal self-dual codes of lengths 36, 48, 52 and 64 and constructs new extremal ternary quasi-twin codes of length 32, 40, 44, 52, 56 and 56.
On Binary Self-Dual Codes With Automorphisms
  • R. Yorgova
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2008
In this correspondence, we present some results concerning a decomposition of binary self-dual codes possessing an automorphism of certain type. Two applications are given. The first one is the
An Extremal Doubly Even Self-Dual Code of Length 112
  • M. Harada
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2008
TLDR
This length is the smallest length for which no extremal doubly even self-dual code of length $n \not\equiv 0 \pmod{24}$ has been constructed.
Constructing self-dual codes using an automorphism group
  • R. Yorgova
  • Computer Science
    2006 IEEE Information Theory Workshop - ITW '06 Chengdu
  • 2006
TLDR
Some new theoretical results concerning a decomposition of a binary self-dual code having an automorphism of a composite order will be presented as well as some examples to illustrate the methods.
Extremal binary self-dual codes
TLDR
In this correspondence, the first extremal Type I [86,43,16] code and new extremal self-dual codes with weight enumerators which were not previously known to exist for lengths 40,50,52 and 54 are constructed.
On the doubly-even self-dual codes of length 96
  • R. Dontcheva
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 2002
We prove that 23, 11, and 7 do not divide the order of the automorphism group of a binary [96, 48, 20] doubly-even self-dual code. We construct 25 new inequivalent binary [96, 48, 16] doubly-even
Self-Dual Codes
A survey of self-dual codes, written for the Handbook of Coding Theory. Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory.
Extremal self-dual codes of length 64 through neighbors and covering radii
TLDR
By considering their doubly even neighbors, extremal doublyEven self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.
Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes
TLDR
It is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circular code and its shadow through a relationship between bordered and pure doublecirculant codes.
...
1
2
3
4
...