Skip to main content
SpringerLink
Log in

The length function: A revised table

  • Covering Codes
  • Conference paper
  • First Online:
Book cover Algebraic Coding (Algebraic Coding 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 781))

Included in the following conference series:

Abstract

We give a table with the most current available information for the shortest length of a binary code with codimension m and covering radius r for 2≤m≤24 and 2≤r≤12.

This work was supported in part by NSA Grant MDA 904-91-H-0003.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.A. Brualdi, V.S. Hess, R.M. Wilson: Short codes with a given covering radius. IEEE IT-35, 99–109 (1989)

    Google Scholar 

  2. R.A. Brualdi, V.S. Pless: On the length of codes with a given covering radius. In: Coding Theory and Design Theory. Part I: Coding Theory. Springer-Verlag 1990, pp. 9–15

    Google Scholar 

  3. A.A. Davydov, A.Y. Drozhzhina-Labinskaya: Constructions, families and tables of binary linear covering codes. IEEE IT, to appear

    Google Scholar 

  4. R. Dougherty, H. Janwa: Covering radius computations for binary cyclic codes. Mathematics of Computation 57, 415–434 (1991)

    Google Scholar 

  5. R.L. Graham, N.J.A. Sloane: On the covering radius of codes. IEEE IT-31, 385–401 (1985)

    Article  Google Scholar 

  6. X.D. Hou: Covering radius and error correcting codes. Ph. D. thesis, University of Illinois, Chicago 1990, 77 p.

    Google Scholar 

  7. X.D. Hou: New lower bounds for covering codes. IEEE IT-36, 895–899 (1990)

    Google Scholar 

  8. D. Li, W. Chen: New lower bounds for binary covering codes. IEEE IT, to appear

    Google Scholar 

  9. R. Struik: On the structure of linear codes with covering radius two and three. IEEE IT, submitted

    Google Scholar 

  10. R. Struik: An improvement of the van Wee bound for linear covering codes. IEEE IT, submitted

    Google Scholar 

  11. G.J.M. van Wee: Improved sphere bounds on the covering radius of codes. IEEE. IT-34, 237–245 (1988)

    Google Scholar 

  12. O. Ytrehus: Binary [18,11]2 codes do not exist — nor do [64,53]2 codes. IEEE IT-37, 349–351 (1991)

    MathSciNet  Google Scholar 

  13. Z. Zhang, C. Lo: Lower bounds on t[n,k] from linear inequalities. IEEE IT-38, 194–197 (1992)

    Google Scholar 

  14. Z. Zhang, C. Lo: Linear inequalities for covering codes: Part II — triple covering inequalities. IEEE IT-38, 1648–1662 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt INF, Centre National de la Recherche Scientifique Télécom Paris, 46 rue Barrault, 75634, Paris Cedex 13, France

    Antoine Lobstein

  2. Mathematics Department, University of Illinois at Chicago, 60680, Chicago, IL, USA

    Vera Pless

Authors
  1. Antoine Lobstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vera Pless
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cohen S. Litsyn A. Lobstein G. Zémor

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lobstein, A., Pless, V. (1994). The length function: A revised table. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds) Algebraic Coding. Algebraic Coding 1993. Lecture Notes in Computer Science, vol 781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57843-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-57843-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57843-7

  • Online ISBN: 978-3-540-48357-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation