On Chebyshev radius of a set in Hamming space and the closest string problem
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 ba...
Main Authors: | Mazumdar, Arya, Polyanskiy, Yury, Saha, Barna |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90564 https://orcid.org/0000-0002-2109-0979 |
Similar Items
-
Hypercontractivity of Spherical Averages in Hamming Space
by: Polyanskiy, Yury
Published: (2021) -
On metric properties of maps between Hamming spaces and related graph homomorphisms
by: Polyanskiy, Yury
Published: (2019) -
Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
by: Young, Andrew J., et al.
Published: (2016) -
The adversarial joint source-channel problem
by: Kochman, Yuval, et al.
Published: (2013) -
A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques
by: Shirley Xu, et al.
Published: (2022-01-01)