摘要
该文给出并证明了构造零相关窗(ZCW)互补码的二叉树方法,当码字足够长时这种方法构造的码字数与理论上界的数目最多仅相差1。为了增加可用的码字,采用互补码与扩展矩阵直积的方法,将一个互补码构造成一组码,组内码字的相关特性取决于扩展矩阵,但不同组之间的码字仍有ZCW。
A binary tree scheme to construct Zero Correlation Window (ZCW) complementary codes is presented. The gap between the code number of the construction method and that of the theoretic bound is at most one when the code is long enough. In order to obtain more usable codes, a set of codes can be constructed through the direct product of the complementary code and an extend matrix. The correlation property of the code in one set lies on the extend matrix, nevertheless the ZCW still exists between any two codes in any different code sets.
出处
《电子与信息学报》
EI
CSCD
北大核心
2007年第3期648-651,共4页
Journal of Electronics & Information Technology
基金
国家自然科学基金重点项目(69931050)资助课题
关键词
互补码
二叉树
零相关窗
Complementary code
Binary tree
Zero Correlation Window (ZCW)