Title :
The linear complexity of binary sequences with optimal autocorrelation
Author :
Wang, Qi ; Du, Xiaoni
Author_Institution :
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China
Abstract :
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are investigated. These two constructions are powerful and generic in the sense that many classes of binary sequences could be obtained from binary sequences with ideal autocorrelation. Both the linear complexity and the minimal polynomial of all the classes of binary sequences are determined.
Keywords :
binary sequences; polynomials; binary sequences; linear complexity; minimal polynomial; optimal autocorrelation; Autocorrelation; Binary sequences; Computer science; Educational institutions; Galois fields; Information science; Interleaved codes; Mathematics; Polynomials; Zinc;
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
DOI :
10.1109/ISIT.2010.5513661
