Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces
From MaRDI portal
Publication:6403315
arXiv2206.13617MaRDI QIDQ6403315FDOQ6403315
Authors: Alexander Barg, Ching-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu 
Publication date: 27 June 2022
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.
This page was built for publication: Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6403315)
