Skip to main content
SpringerLink
Log in

Distances in Coding Theory

  • Chapter
Encyclopedia of Distances

  • 2363 Accesses

Abstract

Coding Theory deals with the design and properties of error-correcting codes for the reliable transmission of information across noisy channels in transmission lines and storage devices. The aim of Coding Theory is to find codes which transmit and decode fast, contain many valid code words, and can correct, or at least detect, many errors. These aims are mutually exclusive, however; so, each application has its own good code.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Batagelj V. Norms and Distances over Finite Groups, J. Comb. Inf. Syst. Sci., Vol. 20, pp. 243–252, 1995.

    MATH  MathSciNet  Google Scholar 

  2. Berrou C., Glavieux A. and Thitimajshima P. Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes, in Proc. of IEEE Int. Conf. on Communication, pp. 1064–1070, 1993.

    Google Scholar 

  3. Brualdi R.A., Graves J.S. and Lawrence K.M. Codes with a Poset Metric, Discrete Math., Vol. 147, pp. 57–72, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. Farrán J.N. and Munuera C. Goppa-Like Bounds for the Generalized Feng–Rao Distances, Discrete Appl. Math., Vol. 128, pp. 145–156, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  5. Gabidulin E.M. and Simonis J. Metrics Generated by Families of Subspaces, IEEE Trans. Inf. Theory, Vol. 44-3, pp. 1136–1141, 1998.

    Article  MathSciNet  Google Scholar 

  6. Goppa V.D. Rational Representation of Codes and (L,g)-Codes, Probl. Pereda. Inf., Vol. 7-3, pp. 41–49, 1971.

    MATH  MathSciNet  Google Scholar 

  7. Huber K. Codes over Gaussian Integers, IEEE Trans. Inf. Theory, Vol. 40-1, pp. 207–216, 1994.

    Article  MATH  Google Scholar 

  8. Huber K. Codes over Eisenstein–Jacobi Integers, Contemp. Math., Vol. 168, pp. 165–179, 1994.

    Article  Google Scholar 

  9. Martin W.J. and Stinson D.R. Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-nets, Can. J. Math., Vol. 51, pp. 326–346, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  10. Rosenbloom M.Y. and Tsfasman M.A. Codes for the m-Metric, Probl. Inf. Transm., Vol. 33-1, pp. 45–52, 1997.

    MATH  Google Scholar 

  11. Sharma B.D. and Kaushik M.L. Limites Intensity Random and Burst Error Codes with Class Weight Considerations, Elektron. Inf.verarb. Kybern., Vol. 15, pp. 315–321, 1979.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Normale Supérieure, Paris, France

    Michel Marie Deza

  2. Moscow State Pedagogical University, Moscow, Russia

    Elena Deza

Authors
  1. Michel Marie Deza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elena Deza
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Deza, M.M., Deza, E. (2013). Distances in Coding Theory. In: Encyclopedia of Distances. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30958-8_16

Download citation

Publish with us

Policies and ethics

Search

Navigation