Skip to main content
SpringerLink
Log in

Class of generalized Goppa codes perfect in weighted Hamming metric

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

Abstract

A weighted Hamming metric is considered. A class of binary linear codes consistent with the weighted Hamming metric is discussed. A class of binary generalized Goppa codes perfect in the weighted Hamming metric is offered.

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. Litwin L. and Pugel M. (2001). The principles of OFDM. RF Des. 24: 30–48

    Google Scholar 

  2. Chou W. and Neifeld M. (1998). Interleaving and error correction in volume holographic memory systems. Appl. Opt. 37: 6951–6968

    Article  Google Scholar 

  3. Sehlstedt M., LeBlanc J.P.: Nonuniform bit-energy distribution in wireless video frames. In: Second Finnish Wireless Communications Workshop, pp. 13–18. Tampere University of Technology, Tampere (2001).

  4. Hossein P.N., Nazanin R. and Faramarz F. (2005). Nonuniform error correcting using low-density parity-check codes. IEEE Trans. Inform. Theory 51(7): 292–295

    Google Scholar 

  5. Park J. and Moon J. (2009). Error-pattern-correcting cyclic codes tailored to a prescribed set of error cluster patterns. IEEE Trans. Inform. Theory 55(4): 1747–1765

    Article  MathSciNet  Google Scholar 

  6. Deza M., Karpovsky M.G. and Milman V.S. (1981). Codes correcting arbitrary sets of errors. Revue de Cethedec 66: 65–76

    MathSciNet  MATH  Google Scholar 

  7. Deza M. and Deza E. (2009). Encyclopedia of Distances. Springer, Berlin

    Book  MATH  Google Scholar 

  8. Shekhunova N.A. and Mironchikov E.T. (1981). Cyclic (L, G)-codes. Probl. Inform. Transm. 17(2): 3–9

    MathSciNet  Google Scholar 

  9. Bezzateev S.V., Shekhunova N.A.: Generalized Goppa codes for correcting localized errors. In: IEEE International Symposium on Information Theory, p. 377. IEEE, Boston (1998).

  10. Goppa V.D. (1970). A new class of linear error correcting codes. Probl. Inform. Transm. 6(3): 24–30

    MathSciNet  MATH  Google Scholar 

  11. MacWilliams F.J. and Sloane N.J.A. (1977). The Theory of Error-Correcting Codes. North-Holland, Amsterdam

    MATH  Google Scholar 

  12. Leng S. (1993). Algebra. Addison, Reading

    Google Scholar 

  13. Carlitz L. (1932). The arithmetic of polynomials in a Galois field. Am. J. Math. 54: 39–50

    Article  Google Scholar 

  14. Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de. Accessed 2 Sept 2009.

Download references

Author information

Authors and Affiliations

  1. Saint Petersburg State University of Aerospace Instrumentation, St. Petersburg, 190000, Russia

    Sergey Bezzateev & Natalia Shekhunova

Authors
  1. Sergey Bezzateev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia Shekhunova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey Bezzateev.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bezzateev, S., Shekhunova, N. Class of generalized Goppa codes perfect in weighted Hamming metric. Des. Codes Cryptogr. 66, 391–399 (2013). https://doi.org/10.1007/s10623-012-9739-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9739-6

Keywords

Mathematics Subject Classification (2010)

Search

Navigation