Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20

Authors:
V. Pless;N. Sloane;H. Ward
Affiliations:
-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Note: A complete classification of ternary self-dual codes of length 24

Journal of Combinatorial Theory Series A
Experimental constructions of self-dual codes

Finite Fields and Their Applications
On the classification and enumeration of self-dual codes

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Self-orthogonal ternary codes of minimum weight3may be analyzed in a straightforward manner using the theory of glueing introduced in earlier papers. The present paper describes a method for studying codes of minimum weight6: the supports of the words of weight6form what is called a center set. Associated with each center set is a graph, and all the graphs that can arise in this way are known. These techniques are used to classify the ternary self-dual codes of length20: there are24inequivalent codes,17of which are indecomposable. Six of the codes have minimum weight6.