2017/02/20 by Qi Zhang, Jing Yang, Zhang, Qi +1
Computer Science · Mathematics · #Advanced Algebra and Geometry #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #Number Theory (math.NT) #cs.IT #math.IT #math.NT
paper · pdf · doi:10.48550/arxiv.1702.05867
10 pages
arxiv created 2017/02/20 · openalex publication_date 2017/02/20 · arxiv updated 2017/02/21 · openalex created_date 2017/03/16 · openalex updated_date 2026/07/28
Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use of Gauss sums and Jacobi sums in the "semiprimitive" case, we derive new divisibility results for SLCE sequences.