Open problem 1: Covering radius of the circuit code

  • Patrick Solé
Note And Problems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)


  1. [1]
    C. Berge, “Graphes et Hypergraphes,” Dunod (1984).Google Scholar
  2. [2]
    A. McLoughlin, “The complexity of the covering radius,” IEEE Tr. on Inf. Th., (Nov. 1984.)Google Scholar
  3. [3]
    D. J. Walsh, “Matroid Theory,” Academic Press (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Patrick Solé
    • 1
  1. 1.School of Computer and Information ScienceSyracuse UniversitySyracuse

Personalised recommendations