FAMILIES OF p-ARY SEQUENCES WITH LOW CORRELATION AND LARGE LINEAR COMPLEXITY

This paper generalizes a method of generating shift sequences in the interleaved construc- tion proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also establ...

Full description

Saved in:
Bibliographic Details
Published inJournal of systems science and complexity Vol. 27; no. 6; pp. 1305 - 1319
Main Authors Cai, Han, Zeng, Xiangyong, Hu, Lei
Format Journal Article
LanguageEnglish
Published Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.12.2014
Subjects
Complex Systems
Control
Mathematics
Mathematics and Statistics
Mathematics of Computing
Operations Research/Decision Theory
p元序列
Statistics
Systems Theory
二进制序列
作者
家庭
相关特性
移位序列
线性
low correlation
cross-correlation
Auto-correlation
linear complexity
ary sequence
Online AccessGet full text

Cover

More Information
Summary:This paper generalizes a method of generating shift sequences in the interleaved construc- tion proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
Bibliography:11-4543/O1
Auto-correlation, cross-correlation, linear complexity, low correlation, p-ary sequence.
This paper generalizes a method of generating shift sequences in the interleaved construc- tion proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
ISSN:1009-6124
1559-7067
DOI:10.1007/s11424-014-1243-9