Skip to main content
SpringerLink
Log in

The domain of covering codes

  • Conference paper
  • First Online:
Coding Theory and Algebraic Geometry

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1518))

  • 868 Accesses

Abstract

In this paper the relationship between the normalised covering radius and the rate is considered for both linear and unrestricted codes. We characterise explicitly, for both cases, the region in the unit square where this type of behaviour is possible and show that certain types of asymptotic properties are wholly dependent upon it.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Cohen and P. Frankl; Good coverings of Hamming spaces with spheres; Discrete Math. 56 (1985), 125–131.

    Article  MathSciNet  MATH  Google Scholar 

  2. G.D. Cohen, M.R. Karpovsky, H.F. Mattson, Jr., and J.R. Schatz, Covering radius: Survey and recent results; IEEE Trans. Inform. Theory 31 (1985), 328–343.

    Article  MathSciNet  MATH  Google Scholar 

  3. J.H. van Lint; Introduction to coding theory, New York: Springer-Verlag, 1982.

    Book  MATH  Google Scholar 

  4. F.J. MacWilliams and N.J.A. Sloane: The theory of error-correcting codes, Amsterdam: North-Holland, 1977.

    MATH  Google Scholar 

  5. Yu.I. Manin, What is the maximum number of points on a curve over F 2?, J. Fac. Sci. Univ. Tokyo 28 (1981), 715–720.

    MathSciNet  MATH  Google Scholar 

  6. G.F. Simmons; Introduction to topology and modern analysis, New York: McGraw-Hill, 1963.

    MATH  Google Scholar 

  7. S.G. Vladut and Yu.I. Manin; Linear codes and modular curves, Itogi Nauki i Tekhniki, Seriya Sovremennye Problemy Matematiki, Noveishie Dostizheniya 25 (1984), 209–257.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C.N.R.S. - U.R.A.1376, Laboratoire I.3.S., 250 rue Albert Einstein, 06560, Valbonne, France

    Philip Stokes

Authors
  1. Philip Stokes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Henning Stichtenoth Michael A. Tsfasman

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag

About this paper

Cite this paper

Stokes, P. (1992). The domain of covering codes. In: Stichtenoth, H., Tsfasman, M.A. (eds) Coding Theory and Algebraic Geometry. Lecture Notes in Mathematics, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088000

Download citation

  • DOI: https://doi.org/10.1007/BFb0088000

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55651-0

  • Online ISBN: 978-3-540-47267-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation