Skip to main content
SpringerLink
Log in

A family of ternary quasi-perfect BCH codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.

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. Baicheva Ts., Dodunekov S.M., Kötter R. (2002): On the performance of the ternary [13,7,5] quadratic-residue code. IEEE Trans. Inform. Theory 48(2): 562–564

    Article  MATH  MathSciNet  Google Scholar 

  2. Blahut R.E. (1993): The Theory and Practice of Error Control Codes. Addison-Wesley, Reading, MA, USA

    Google Scholar 

  3. Dodunekov S.M. (1985): The optimal double-error correcting codes of Zetterberg and Dumer-Zinovev are quasiperfect. C. R. Acad. Bulgare Sci. 38(9): 1121–1123

    MATH  MathSciNet  Google Scholar 

  4. Dodunekov S.M. (1986): Some quasiperfect double error correcting codes. Prob. Control Inform. Theory/Problemy Upravlen. Teor. Inform. 15(5): 367–375

    MATH  MathSciNet  Google Scholar 

  5. Dumer I.I., Zinoviev V.A. (1978): Some new maximal codes over GF(4). Problemy Peredachi Informatsii 14(3): 24–34

    MATH  Google Scholar 

  6. Etzion T., Mounits B. (2005): Quasi-perfect codes with small distance. IEEE Trans. Inform. Theory 51(11): 3928–3946

    Article  MathSciNet  Google Scholar 

  7. Gashkov I.B., Sidelnikov V.M. (1986): Linear ternary quasiperfect codes that correct double errors. Problemy Peredachi Informatsii 22(4): 43–48

    MathSciNet  Google Scholar 

  8. Gevorkjan D.N., Avetisjan A.M., Tigranjan G.A. (1975): K voprosu o postroenii kodov s ispravleniem dvuh oshibok v metrike hemminga nad poljami galua. Vichislitel’naja tehnika 3: 19–21

    Google Scholar 

  9. Gorenstein D.C., Peterson W.W., Zeirler N. (1960): Two-error correcting Bose-Chaudhuri codes are quasi- perfect. Info. Control 3, 291–294

    Article  MATH  Google Scholar 

  10. MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. Amsterdam, North-Holland, sixth printing (1988).

  11. Tietäväinen A. (1973): On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24, 88–96

    Article  MATH  MathSciNet  Google Scholar 

  12. Tietäväinen A. (1974): A short proof for the nonexistence of unknown perfect codes over GF(q), q > 2. Ann. Acad. Sci. Fenn. Ser. A I 580: 6

    Google Scholar 

  13. Zinoviev V.A., Leontiev V.K. (1973): On non-existence of perfect codes over Galois fields. Prob. Control Inform. Theory/Problemy Upravlenija i Teorii Informacii 2(2): 123–132

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Linköping University, 581 83, Linkoping, Sweden

    Danyo Danev

  2. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 8 G. Bontchev Street, 1113, Sofia, Bulgaria

    Stefan Dodunekov

Authors
  1. Danyo Danev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Dodunekov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Danyo Danev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Danev, D., Dodunekov, S. A family of ternary quasi-perfect BCH codes. Des. Codes Cryptogr. 49, 265–271 (2008). https://doi.org/10.1007/s10623-008-9193-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9193-7

Keywords

AMS Classifications

Search

Navigation