Skip to main content
SpringerLink
Log in

On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

The number of known inequivalent binary self-complementary [120, 9, 56] codes (and hence the number of known binary self-complementary [136, 9, 64] codes) is increased from 25 to 4668 by showing that there are exactly 4650 such inequivalent codes with an automorphism of order 3. This implies that there are at least 4668 nonisomorphic quasi-symmetric SDP designs with parameters (v = 120, k = 56, λ = 55) and as many SDP designs with parameters (v = 136, k = 64, λ = 56).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Grey, L.D., Some Bounds for Error-Correcting Codes, IEEE Trans. Inform. Theory, 1962, vol. 8, no. 3, pp. 200–202.

    Article  MathSciNet  Google Scholar 

  2. Rankin, R.A., The Closest Packing of Spherical Caps in n Dimensions, Proc. Glasgow Math. Assoc., 1955, vol. 2, pp. 139–144.

    Article  MATH  MathSciNet  Google Scholar 

  3. Rankin, R.A., On the Minimal Points of Positive Definite Quadratic Forms, Mathematika, 1956, vol. 3, pp. 15–24.

    Article  MATH  MathSciNet  Google Scholar 

  4. McGuire, G., Quasi-symmetric Designs and Codes Meeting the Grey-Rankin Bound, J. Combin. Theory, Ser. A, 1997, vol. 78, no. 2, pp. 280–291.

    Article  MATH  MathSciNet  Google Scholar 

  5. Jungnickel, D. and Tonchev, V.D., Exponential Number of Quasi-symetric SDP Designs and Codes Meeting the Grey-Rankin Bound, Des. Codes Cryptogr., 1991, vol. 1, no. 3, pp. 247–253.

    Article  MATH  MathSciNet  Google Scholar 

  6. Parker, C., Spence, E., and Tonchev, V.D., Designs with the Symmetric Difference Property on 64 Points and Their Groups, J. Combin. Theory, Ser. A, 1994, vol. 67, no. 1, pp. 23–43.

    Article  MATH  MathSciNet  Google Scholar 

  7. Kantor, W., Exponential Numbers of Two-Weight Codes, Difference Sets and Symmetric Designs, Discrete Math., 1983, vol. 46, no. 1, pp. 95–98.

    Article  MATH  MathSciNet  Google Scholar 

  8. Dodunekov, S.M., Encheva, S.B., and Kapralov, S.N., On the [28, 7, 12] Binary Self-complementary Codes and Their Residuals, Des. Codes Cryptogr., 1994, vol. 4, no. 1, pp. 57–67.

    Article  MATH  MathSciNet  Google Scholar 

  9. Dodunekov, S. and Simonis, J., Codes and Projective Multisets, Electronic J. Combin., 1998, vol. 5, no. 1, Research Paper R37.

  10. Gulliver, T.A. and Harada, M., Codes of Lengths 120 and 136 Meeting the Grey-Rankin Bound and Quasi-symmetric Designs, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 2, pp. 703–706.

    Article  MATH  MathSciNet  Google Scholar 

  11. Huffman, W.C., Automorphisms of Codes with Application to Extremal Doubly-Even Codes of Length 48, IEEE Trans. Inform. Theory, 1982, vol. 28, no. 3, pp. 511–521.

    Article  MATH  MathSciNet  Google Scholar 

  12. Yorgov, V.Y., A Method for Constructing Inequivalent Self-dual Codes with Applications to Length 56, IEEE Trans. Inform. Theory, 1987, vol. 33, no. 1, pp. 77–82.

    Article  MATH  MathSciNet  Google Scholar 

  13. Bouyukliev, I., Q-Extension [software]. Available online at http://www.moi.math.bas.bg/:_iliya/Q-ext.htm.

  14. Bouyukliev, I., Bouyuklieva, S., Gulliver, T.A., and Östergård, P.R.J., Classification of Optimal Binary Self-orthogonal Codes, J. Combin. Math. Combin. Comput., 2006, vol. 59, pp. 33–87.

    MATH  MathSciNet  Google Scholar 

  15. Jaffe, D.B., Information about Binary Linear Codes [electronic table; online]. Available at http://www.math.unl.edu/:_djaffe/codes/webcodes/codeform.html.

  16. Bouyukliev, I., Fack, V., Willems, W., and Winne, J., Projective Two-Weight Codes with Small Parameters and Their Corresponding Graphs, Des. Codes Cryptogr., 2006, vol. 41, no. 1, pp. 59–78.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, BAS, Veliko Tarnovo, Bulgaria

    I. Bouyukliev

  2. Department of Mathematics and Informatics, Veliko Tarnovo University, Bulgaria

    S. Bouyuklieva

  3. Institute of Mathematics and Informatics, BAS, Sofia, Bulgaria

    S. Dodunekov

Authors
  1. I. Bouyukliev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Bouyuklieva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Dodunekov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © I. Bouyukliev, S. Bouyuklieva, S. Dodunekov, 2007, published in Problemy Peredachi Informatsii, 2007, Vol. 43, No. 2, pp. 25–33.

Supported in part by the Bulgarian National Science Foundation, contract nos. MM1304/2003 and MM1405/2004. The second author is also supported by a Research Fellowship from the Alexander von Humboldt Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouyukliev, I., Bouyuklieva, S. & Dodunekov, S. On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs. Probl Inf Transm 43, 89–96 (2007). https://doi.org/10.1134/S0032946007010020

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946007010020

Search

Navigation