Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
Authors:
- V. PlessVPV. Pless
- N. SloaneNSN. Sloane
- H. WardHWH. Ward
- 1 May 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (3) , 305-316
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.Keywords
This publication has 8 references indexed in Scilit:
- Center sets and ternary codesJournal of Algebra, 1980
- On the enumeration of self-dual codesJournal of Combinatorial Theory, Series A, 1980
- Self-dual codes overGF(3)andGF(4)of length not exceeding 16IEEE Transactions on Information Theory, 1979
- Self-dual codes and lattices1979
- Self-Dual Codes over ${\text{GF}}( 3 )$SIAM Journal on Applied Mathematics, 1976
- Symmetric Bilinear Forms1973
- Some subgroups of $SL_{n}(\mathbf{F}_{2})$Illinois Journal of Mathematics, 1969
- Representations of the general symmetric group as linear groups in finite and infinite fieldsTransactions of the American Mathematical Society, 1908