Abstract
Formally self-dual even codes have recently been studied. Double circulant even codes are a family of such codes and almost all known extremal formally self-dual even codes are of this form. In this paper, we classify all extremal double circulant formally self-dual even codes which are not self-dual. We also investigate the existence of near-extremal formally self-dual even codes.
Similar content being viewed by others
References
J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1319–1333.
S. T. Dougherty, M. Harada and M. Oura, Shadows and formally self-dual codes (submitted).
G. T. Kennedy, Weight distributions of linear codes and the Gleason-Pierce theorem, J. Combin. Theory Ser. A, Vol. 67 (1994) pp. 72–88.
G. T. Kennedy and V. Pless, On designs and formally self-dual codes, Des. Codes and Cryptogr., Vol. 4 (1994) pp. 43–55.
M. Harada, The existence of a self-dual [70, 35, 12] code and formally self-dual codes, Finite Fields and Their Appl. (to appear).
M. Harada, T. A. Gulliver and H. Kaneta, Classification of extremal double circulant self-dual codes of length up to 62 (submitted).
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
C. L. Mallows and N. J. A. Sloane, An upper bound for self-dual codes, Inform. Control, Vol. 22 (1973) pp. 188–200.
J. Simonis, The [18, 9, 6] code is unique, Discrete Math., Vol. 106/107 (1992) pp. 439–448.
H. N. Ward, A restriction on the weight enumerator of a self-dual code, J. Combin. Theory Ser. A, Vol. 21 (1976) pp. 253–255.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gulliver, T.A., Harada, M. Classification of Extremal Double Circulant Formally Self-Dual Even Codes. Designs, Codes and Cryptography 11, 25–35 (1997). https://doi.org/10.1023/A:1008206223659
Issue Date:
DOI: https://doi.org/10.1023/A:1008206223659