Duality between Packings and Coverings of the Hamming Space
<|reference_start|>Duality between Packings and Coverings of the Hamming Space: We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class of linear or nonlinear codes) are good packings, then only a vanishing fraction of codes are good coverings, and vice versa: if almost all codes are good coverings, then at most a vanishing fraction of codes are good packings. We also show that any specific maximal binary code is either a good packing or a good covering, in a certain well-defined sense.<|reference_end|>
@article{cohen2005duality,
    title={Duality between Packings and Coverings of the Hamming Space},
    author={G'erard Cohen and Alexander Vardy},
    journal={arXiv preprint arXiv:cs/0507015},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0507015},
    primaryClass={cs.IT cs.DM math.IT}
}