Skip to main content
SpringerLink
Log in

Construction of self-orthogonal codes from combinatorial designs

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

Abstract

Self-orthogonal codes are constructed from matrices generated according to parameters of combinatorial designs. An approach towards generating designs and such matrices is considered. Some classification results on self-orthogonal codes are also presented.

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. Tonchev, V., Kobminatorni strukturi i kodovi (Combinatorial Structures and Codes), Sofia: Kliment Ohridski Univ. Press, 1988.

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  3. Kaski, P. and Östergård, P., Classification Algorithms for Codes and Designs, Berlin: Springer, 2006.

    MATH  Google Scholar 

  4. The CRC Handbook of Combinatorial Designs, Colbourn, C.J. and Dinitz, J.H., Eds., Boca Raton: CRC Press, 1996.

    MATH  Google Scholar 

  5. Huffman, W.C. and Pless, V., Fundamentals of Error-Correcting Codes, Cambridge: Cambridge Univ. Press, 2003.

    Book  MATH  Google Scholar 

  6. Bouyukliev, I. and Simonis, J., Some New Results for Optimal Ternary Linear Codes, IEEE Trans. Inform. Theory, 2002, vol. 48, no. 4, pp. 981–985.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bouyukliev, I., What is Q-Extension?, Serdica J. Comput., 2007, vol. 1, no. 2, pp. 115–130. Available at http://www.moi.math.bas.bg/~iliya/Q_ext.htm.

    MathSciNet  MATH  Google Scholar 

  8. Grassl, M., Bounds on the Minimum Distance of Linear Codes and Quantum Codes (electronic tables). Available at http://www.codetables.de (accessed on August 14, 2011).

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Veliko Tarnovo, Bulgaria

    M. Dzhumalieva-Stoeva

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

    M. Dzhumalieva-Stoeva

  3. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Veliko Tarnovo, Bulgaria

    I. G. Bouyukliev

  4. Faculty of Mathematics and Informatics, Veliko Tarnovo University, Veliko Tarnovo, Bulgaria

    V. Monev

Authors
  1. M. Dzhumalieva-Stoeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. G. Bouyukliev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Monev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Dzhumalieva-Stoeva.

Additional information

Original Russian Text © M. Dzhumalieva-Stoeva, I.G. Bouyukliev, V. Monev, 2012, published in Problemy Peredachi Informatsii, 2012, vol. 48, No. 3, pp. 60–69.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dzhumalieva-Stoeva, M., Bouyukliev, I.G. & Monev, V. Construction of self-orthogonal codes from combinatorial designs. Probl Inf Transm 48, 250–258 (2012). https://doi.org/10.1134/S0032946012030052

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation