Derives the asymptotic rate of maximum cardinality of intersection of three Hamming balls with radii αn and inter-center distance βn.
On levenshtein’s channel and list size in information retrieval,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
List Reconstruction Problem with List Size Two
Derives the asymptotic rate of maximum cardinality of intersection of three Hamming balls with radii αn and inter-center distance βn.