Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces
Combinatorics
2022-07-08 v2 Information Theory
math.IT
Abstract
We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works by Barg-Musin and Musin-Nozaki. As our main result, we find new parameters for which the maximum size of two- and three-distance sets is known exactly.
Cite
@article{arxiv.2206.13617,
title = {Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces},
author = {Alexander Barg and Ching-Yi Lai and Pin-Chieh Tseng and Wei-Hsuan Yu},
journal= {arXiv preprint arXiv:2206.13617},
year = {2022}
}
Comments
Renew the whole article to add more results and authors