×

Optimal ternary formally self-dual codes. (English) Zbl 1057.94041

Summary: In this paper, we study ternary optimal formally self-dual codes. Bounds for the highest minimum weight are given for length up to 30 and examples of optimal formally self-dual codes are constructed. For some lengths, we have found formally self-dual codes which have a higher minimum weight than any self-dual code. It is also shown that any optimal formally self-dual \([10,5,5]\) code is related to the ternary Golay code of length 12.

MSC:

94B60 Other types of codes
Full Text: DOI

References:

[1] Chan, H. C.; Rodger, C. A.; Seberry, J., On inequivalent weighing matrices, Ars Combin., 21, 299-333 (1986) · Zbl 0599.05013
[2] Conway, J. H.; Pless, V.; Sloane, N. J.A., Self-dual codes over GF(3) and GF(4) of length not exceeding 16, IEEE Trans. Inform. Theory, 25, 312-322 (1979) · Zbl 0401.94025
[3] Dougherty, S. T., Shadow codes and weight enumerators, IEEE Trans. Inform. Theory, 41, 762-768 (1995) · Zbl 0824.94020
[4] S.T. Dougherty, M. Harada, M. Oura, Formally self-dual codes, preprint.; S.T. Dougherty, M. Harada, M. Oura, Formally self-dual codes, preprint. · Zbl 0984.94028
[5] Hall, M., Hadamard matrices of order 16, J.P.L. Research Summary, 36-10, 1, 21-26 (1961)
[6] Hall, M., Hadamard matrices of order 20, J.P.L. Technical Report No. 32-761 (1965)
[7] Harada, M., New extremal ternary self-dual codes, J. Austral. Combin., 17, 133-145 (1998) · Zbl 0914.94012
[8] Leon, J. S.; Pless, V.; Sloane, N. J.A., On ternary self-dual codes of length 24, IEEE Trans. Inform. Theory, 27, 176-180 (1981) · Zbl 0458.94040
[9] MacWilliams, F. J.; Mallows, C. L.; Sloane, N. J.A., Generalizations of Gleason’s theorem on weight enumerators of self-dual codes, IEEE Trans. Inform. Theory, 18, 794-805 (1972) · Zbl 0248.94013
[10] Mallows, C. L.; Pless, V.; Sloane, N. J.A., Self-dual codes over GF(3), SIAM J. Appl. Math., 31, 649-666 (1976) · Zbl 0343.94011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.