On Chebyshev radius of a set in Hamming space and the closest string problem
Name
Polyanskiy_On chebyshev.pdf
Size
253.38 KB
Format
Adobe PDF
Checksum (MD5)
869c92e41feeee2b5baa7a0212f9e8c5
Author(s)
Mazumdar, Arya
Polyanskiy, Yury
Saha, Barna
Date Issued
July 2013
Journal
Proceedings of the 2013 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Mazumdar, Arya, Yury Polyanskiy, and Barna Saha. “On Chebyshev Radius of a Set in Hamming Space and the Closest String Problem.” 2013 IEEE International Symposium on Information Theory (July 2013).
Version
Author's final manuscript
Abstract
The Chebyshev radius of a set in a metric space is defined to be the radius of the smallest ball containing the set. This quantity is closely related to the covering radius of the set and, in particular for Hamming set, is extensively studied in computational biology. This paper investigates some basic properties of radii of sets in n-dimensional Hamming space, provides a linear programing relaxation and gives tight bounds on the integrality gap. This results in a simple polynomial-time approximation algorithm that attains the performance of the best known such algorithms with shorter running time.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2013.6620457
