Skip to main content
SpringerLink
Log in

An extremal problem related to the covering radius of binary codes

  • Conference paper
  • First Online:
Algebraic Coding (Algebraic Coding 1991)

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

Included in the following conference series:

Abstract

We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius; we solve the problem in some cases, give some bounds, and also show how it relates to the construction of good codes with distance 3.

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. G.D. Cohen, P. Godlewski, and F. Merkx, “Linear Block Codes for Write-Once Memories”, IEEE Trans. on Inf. Theory, IT 29, 3, (1983) 731–739.

    Google Scholar 

  2. P. Godlewski, “WOM-codes construits à partir des codes de Hamming”, Discrete Math., 65 (1987), 237–243.

    Article  Google Scholar 

  3. F.J. Mac Williams and N.J.A. Sloane, “The Theory of Error-Correcting Codes” 1977 North Holland Amsterdam.

    Google Scholar 

  4. H.B. Mann, “Addition theorems”, 1965 Wiley New-York.

    Google Scholar 

  5. R.L. Rivest and A. Shamir, “How to reuse a “Write Once” Memory”, Inf. and Control 55, (1982), 1–19.

    Article  Google Scholar 

  6. G. Zémor, “Problèmes combinatoires liés à l'écriture sur des mémoires” Phd dissertation, Nov. 1989.

    Google Scholar 

  7. G. Zémor and G. Cohen, “Error-Correcting WOM-codes”, IEEE Trans. on Inf. Theory, IT 37, 3, (1991) 730–735.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Réseaux, E.N.S.T., 46 rue Barrault, 75634, Paris Cedex 13, France

    G. Zémor

Authors
  1. G. Zémor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Antoine Lobstein Gilles Zémor Simon Litsyn

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zémor, G. (1992). An extremal problem related to the covering radius of binary codes. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034339

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46739-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation