On the linear span of a binary sequence family with optimal correlation properties

被引:0
作者
Zeng, Xiangyong [1 ]
Liu, John Q. [3 ]
Hu, Lei [2 ]
Taylor, Desmond P. [4 ]
机构
[1] Hubei Univ, Fac Math & Comp Sci, Wuhan 430062, Peoples R China
[2] Chinese Acad Sci, Grad Sch, Beijing 100049, Peoples R China
[3] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
[4] Univ Canterbury, Dept Elect & Elect Engn, Christchurch 1, New Zealand
关键词
sequences; optimal correlation; linear span; ideal autocorrelation;
D O I
10.1093/ietfec/e91-a.2.664
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new subfamily of sequences with optimal correlation properties is constructed for the generalized Kasami set. A lower bound on the linear span is established. It is proved that with suitable choices of parameters, this subfamily has exponentially larger linear spans than either No sequences or TN sequences. A class of sequences with ideal autocorrelation is also proved to have large linear span.
引用
收藏
页码:664 / 672
页数:9
相关论文
共 20 条
[1]  
[Anonymous], 1983, ENCY MATH APPL
[2]  
Cover TM, 2006, Elements of Information Theory
[5]   Binary sequences with two-level autocorrelation [J].
Gong, G ;
Golomb, SW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :692-693
[6]   New designs for signal sets with low cross correlation, balance property, and large linear span:: GF (p) case [J].
Gong, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (11) :2847-2867
[7]  
Helleseth T, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P1765
[8]  
KASAMI T, 1966, R285AD632574 U ILL C
[9]  
Kasami T., 1969, COMBINATORIAL MATH I
[10]   ANALYSIS OF STRUCTURE AND COMPLEXITY OF NONLINEAR BINARY SEQUENCE GENERATORS [J].
KEY, EL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :732-736