Self-dual codes over the Kleinian four group

@article{Hhn2000SelfdualCO,
  title={Self-dual codes over the Kleinian four group},
  author={Gerald H{\"o}hn},
  journal={Mathematische Annalen},
  year={2000},
  volume={327},
  pages={227-255}
}
  • Gerald Höhn
  • Published 26 May 2000
  • Computer Science
  • Mathematische Annalen
Abstract.We introduce self-dual codes over the Kleinian four group K=Z2×Z2 for a natural quadratic form on Kn and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to length 8, neighbourhood graphs, extremal codes, shadows, generalized t-designs, lexicographic codes, the Hexacode and its odd and shorter cousin, automorphism groups, marked codes. Kleinian codes form a new and natural fourth step in a series of analogies between binary codes, lattices… 
Graph-based classification of self-dual additive codes over finite fields
TLDR
It is proved that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit, and it is shown that some of these codes have highly regular graph representations.
On the classification of all self-dual additive codes over GF(4) of length up to 12
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.
SOME NEW RESULTS FOR ADDITIVE SELF-DUAL CODES OVER
TLDR
All extremal (optimal) codes of lengths 13 and 14 are classified, and many extremal codes oflength 15 and 16 are constructed, and some new extremalcodes of lengths 17,18,19, and 21 are constructed.
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.
New self-dual codes over GF(4) with the highest known minimum weights
  • Jon-Lark Kim
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 2001
The purpose of this correspondence is to construct new Hermitian self-dual codes over GF(4) of lengths 22, 24, 26, 32, and 34 which have the highest known minimum weights. In particular, for length
Some new Results for Additive Self-Dual Codes over GF(4)
TLDR
All extremal (optimal) codes of lengths 13 and 14 are classified, and many extremal codes oflength 15 and 16 are constructed, and some new extremalcodes of lengths 17,18,19, and 21 are constructed.
On the classification and enumeration of self-dual codes
Quantum stabilizer codes, lattices, and CFTs
TLDR
It is shown that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices and non-chiral CFTs, and thus Narain C FTs are defined.
...
...

References

SHOWING 1-10 OF 122 REFERENCES
Self-Dual Codes over the Integers Modulo 4
On the Enumeration of Self-Dual Codes
A Restriction on the Weight Enumerator of a Self-Dual Code
  • H. Ward
  • Computer Science
    J. Comb. Theory, Ser. A
  • 1976
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.
On Harmonic Weight Enumerators of Binary Codes
  • C. Bachoc
  • Computer Science, Mathematics
    Des. Codes Cryptogr.
  • 1999
TLDR
Some new polynomials associated to a linear binary code and a harmonic function of degree k are defined, which classify the extremal even formally self-dual codes of length 12 and can compute some information on the intersection numbers of the code.
On cyclic reversible self-dual additive codes with odd length over Z22
TLDR
All cyclic and reversible [5,2.5,3] additive codes over Z/sub 2//sup 2/ are isomorphic and possess interesting properties.
WEIGHT POLYNOMIALS OF SELF-DUAL CODES AND THE MacWILLIAMS IDENTITIES
TLDR
The MacWilliams identities are extended to self-dual codes over larger fields and it is shown that this restriction, for codes over GF(2) and GF(3), is that the weight polynomial must lie in an explicitly described free polynometric ring.
On the Classification and Enumeration of Self-Dual Codes
An Upper Bound for Self-Dual Codes
The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration
...
...