New Families of Codebooks Achieving the Levenstein Bound
New Families of Codebooks Achieving the Levenstein Bound
复制标题
DOI：
10.1109/tit.2014.2353052
复制
发表时间：
2014-09
影响因子：
2.5
通讯作者：
Zhengchun Zhou;C. Ding;Nian Li
中科院分区：
文献类型：
--
作者：
Zhengchun Zhou;C. Ding;Nian Li
本文介绍了一种基于满足一定条件的Bent函数集的码本构造方法。它包括一些较早的建设的码书会议莱文斯坦界的特殊情况。通过这种构造，得到了两类新的达到Levenstein界的码本。在本文中构造的码本可以有一个非常小的字母大小。
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.