二进制序列的Tseng游程定理  

THEOREMS OF TSENG RUNS OF BINARY SEQUENCE

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

机构地区：[1]中国西南电子技术研究所,成都610036 [2]北京大学物理系,100871

出　　处：《电子科学学刊》1998年第4期500-507,共8页

摘　　要：本文研究了二进制序列游程相关函数中的Tseng游程的性质,导出了Tseng游程与序列中各种游程长度的游程数之间的关系,为了证明定理的需要,文中引入了游程串,链接元等新概念,证明了几个定理。这些定理不仅清楚地描述了原序列中不同游程长度的游程数对相关函数的旁瓣的影响,而且还揭示了存在可确定码字类型的定型常数.In this paper, The properties of Tseng runs in RCF of a binary sequence are studied. The relation between Tseng runs and run numbers of different run lengths in sequence are derived, and some new conceptions: run catena, concatenated elements, etc., are introduced for proving the theorems in this paper. And these theorems not only clearly describe that the sidelobes of CF are influenced by the run numbers of different run lengths in sequence, but also discover the existence of the typed constant, which may be used to determine the type of code words.

关 键 词：二进制序列 相关函数 游程 

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