Answers are grounded in this paper and cite their sources.
In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived.
No takes yet. Share an insight, caveat, or question.
Xiang et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: