Skip to main content
SpringerLink
Log in

Open problem 1: Covering radius of the circuit code

  • Note And Problems
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1988)

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

Included in the following conference series:

  • 178 Accesses

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

References

  1. C. Berge, “Graphes et Hypergraphes,” Dunod (1984).

    Google Scholar 

  2. A. McLoughlin, “The complexity of the covering radius,” IEEE Tr. on Inf. Th., (Nov. 1984.)

    Google Scholar 

  3. D. J. Walsh, “Matroid Theory,” Academic Press (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Science, Syracuse University, 13244-1240, Syracuse, NY

    Patrick Solé

Authors
  1. Patrick Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

GĂ©rard Cohen Jacques Wolfmann

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solé, P. (1989). Open problem 1: Covering radius of the circuit code. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019871

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51643-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation