1. C. Bachoc, On harmonic weight enumerators of binary codes,Designs, Codes and Cryptogr., Vol. 18 (1999) pp. 11–28.

   Google Scholar 

2. K. Betsumiya, T. A. Gulliver, and M. Harada, On binary extremal formally self-dual even codes,Kyushu J. Math., Vol. 53 (1999) pp. 421–430.

   Google Scholar 

3. A. E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes,IEEE Trans. Inform. Theory, Vol. 39 (1993) pp. 662–677.

   Google Scholar 

4. 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.

   Google Scholar 

5. J. E. Fields, P. Gaborit, W. C. Huffman, and V. Pless, On the classification of extremal even formally self-dual codes,Designs, Codes and Cryptography, Vol. 18 (1999) pp. 125–148.

   Google Scholar 

6. M. Harada, The existence of a self-dual [70, 35, 12] code and formally self-dual codes,Finite Fields and Their Appl., Vol. 3 (1997) pp. 131–139.

   Google Scholar 

7. D. B. Jaffe, Information about binary linear codes (server), University of Nebraska-Lincoln, USA, http://www.math.unl.edu/djaffe/binary/codeform.html.

8. G. Kennedy and V. Pless, On designs and formally self-dual codes,Designs, Codes and Cryptogr., Vol. 4 (1994) pp. 43–55.

   Google Scholar 

9. G. T. Kennedy and V. Pless, A coding theoretic approach to extending designs,Discrete Math., Vol. 142 (1995) pp. 155–168.

   Google Scholar 

10. V. Pless and N. J. A. Sloane, On the classification and enumeration of self-dual codes,J. Combin. Theory Ser. A., Vol. 18 (1975) pp. 313–335.

    Google Scholar 

11. J. Simonis, The [18, 9, 6] code is unique,Discrete Math., Vol. 106/107 (1992) pp. 439–448.

    Google Scholar 

12. V. D. Tonchev, Quasi-symmetric designs and self-dual codes,Europ. J. Combin., Vol. 7 (1986) pp. 67–73.

    Google Scholar 

Download references