最优二进制序列的筛选理论  

Sieve Theory of the Best Binary Sequence

作　　者：杨光正[1] 杨翔宇[1] 徐丽娟[1] 

机构地区：[1]中国西南电子技术研究所

出　　处：《电子学报》1997年第1期121-123,共3页Acta Electronica Sinica

摘　　要：本文研究了最优码的性质，得到的结果表明：最优码不仅具有相关正交性、对偶性，而且其游程、重量均受到严格的限制，同时也证明了码首、码尾满足一定条件的二进制序列肯定不是最优码．在此基础上，本文提出一种新的筛选法，并用实例显示它的有效性．In this paper,the properties of the best code are studied specifically. The results show that the best codes not only have correlation orthogonality and duality,but also their runs and weights are strictly limited. On the other hand,it is proved that a code whose head and tail satisfy certain demands is not the best code. Based on this,a new sieve is presented and an example is given to test its effectiveness.

关 键 词：二进制序列 最优码 筛选法 

分 类 号：TN911.2[电子电信—通信与信息系统]