Tiling Hamming Space with Few Spheres

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that if the collection of all binary vectors of lengthnis partitioned intokspheres, then eitherk≤2 ork≥n+2. Moreover, such partitions withk=n+2 are essentially unique. © 1997 Academic Press.

Cite

CITATION STYLE

APA

Hollmann, H. D. L., Körner, J., & Litsyn, S. (1997). Tiling Hamming Space with Few Spheres. Journal of Combinatorial Theory. Series A, 80(2), 388–393. https://doi.org/10.1006/jcta.1997.2816

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free