218 research outputs found
Self-Dual Codes
Self-dual codes are important because many of the best codes known are of
this type and they have a rich mathematical theory. Topics covered in this
survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight
enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems,
bounds, mass formulae, enumeration, extremal codes, open problems. There is a
comprehensive bibliography.Comment: 136 page
Some new results on the self-dual [120,60,24] code
The existence of an extremal self-dual binary linear code of length 120 is a
long-standing open problem. We continue the investigation of its automorphism
group, proving that automorphisms of order 30 and 57 cannot occur. Supposing
the involutions acting fixed point freely, we show that also automorphisms of
order 8 cannot occur and the automorphism group is of order at most 120, with
further restrictions. Finally, we present some necessary conditions for the
existence of the code, based on shadow and design theory.Comment: 23 pages, 6 tables, to appear in Finite Fields and Their Application
Conformal Designs based on Vertex Operator Algebras
We introduce the notion of a conformal design based on a vertex operator
algebra. This notation is a natural analog of the notion of block designs or
spherical designs when the elements of the design are based on self-orthogonal
binary codes or integral lattices, respectively. It is shown that the subspaces
of fixed degree of an extremal self-dual vertex operator algebra form conformal
11-, 7-, or 3-designs, generalizing similar results of Assmus-Mattson and
Venkov for extremal doubly-even codes and extremal even lattices. Other
examples are coming from group actions on vertex operator algebras, the case
studied first by Matsuo. The classification of conformal 6- and 8-designs is
investigated. Again, our results are analogous to similar results for codes and
lattices.Comment: 35 pages with 1 table, LaTe
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31
A classification of Hadamard matrices of order with an automorphism of
order is given for and . The ternary self-dual codes spanned by
the newly found Hadamard matrices of order with an automorphism of order
are computed, as well as the binary doubly even self-dual codes of length
with generator matrices defined by related Hadamard designs. Several new
ternary near-extremal self-dual codes, as well as binary near-extremal doubly
even self-dual codes with previously unknown weight enumerators are found.Comment: 21 page
Self-dual codes, subcode structures, and applications.
The classification of self-dual codes has been an extremely active area in coding theory since 1972 [33]. A particularly interesting class of self-dual codes is those of Type II which have high minimum distance (called extremal or near-extremal). It is notable that this class of codes contains famous unique codes: the extended Hamming [8,4,4] code, the extended Golay [24,12,8] code, and the extended quadratic residue [48,24,12] code. We examine the subcode structures of Type II codes for lengths up to 24, extremal Type II codes of length 32, and give partial results on the extended quadratic residue [48,24,12] code. We also develop a generalization of self-dual codes to Network Coding Theory and give some results on existence of self-dual network codes with largest minimum distance for lengths up to 10. Complementary Information Set (CIS for short) codes, a class of classical codes recently developed in [7], have important applications to Cryptography. CIS codes contain self-dual codes as a subclass. We give a new classification result for CIS codes of length 14 and a partial result for length 16
- …