Answers are grounded in this paper and cite their sources.
In this paper, a construction of codebooks based on a set of bent functions satisfying certain conditions is introduced. It includes some earlier constructions of codebooks meeting the Levenstein bound as special cases. With this construction, two new families of codebooks achieving the Levenstein bound are obtained. The codebooks constructed in this paper could have a very small alphabet size.
No takes yet. Share an insight, caveat, or question.
Zhou et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: