A Lower Bound on Binary Codes with Covering Radius One

Iiro S. Honkala. A Lower Bound on Binary Codes with Covering Radius One. In Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor, editors, Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Volume 781 of Lecture Notes in Computer Science, pages 34-37, Springer, 1993.

@inproceedings{Honkala93,
  title = {A Lower Bound on Binary Codes with Covering Radius One},
  author = {Iiro S. Honkala},
  year = {1993},
  researchr = {https://researchr.org/publication/Honkala93},
  cites = {0},
  citedby = {0},
  pages = {34-37},
  booktitle = {Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings},
  editor = {Gérard D. Cohen and Simon Litsyn and Antoine Lobstein and Gilles Zémor},
  volume = {781},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57843-9},
}