四川师范大学
四川师范大学 Sichuan Normal University
学术讲座 您所在的位置:首页 > 信息服务 > 学术讲座

On the 2-adic Complexity of Binary Sequences with optimal autocorrelation

2017年01月03日  来源:  浏览:126次
讲座题目:On the 2-adic Complexity of Binary Sequences with optimal autocorrelation
讲座时间:2017-1-6 16:00:00
讲座地点:狮子山校区6教811
主办单位:数学与软件科学学院
主讲人 :李超 教授
主讲人简介:
李超,国防科技大学教授、博士生导师,中国密码学会理事、湖南省数学会常务理事。主持973、863和国家自然科学基金等20余项科研课题;在科学出版社和高等教育出版社等出版专著2部、教材6部、会议录3部;在 IEEE Trans. on Information Theory 和 Science In China 等学术刊物上发表100余篇研究论文,其中SCI论文60余篇,EI论文50余篇。先后获得军队科技进步一等奖1项,部委级科技进步二等奖1项、三等奖2项,军队院校育才奖金奖和银奖各一项。



Abstract: In this talk, A new method is presented to compute the 2-adic complexity of binary pseudo-random sequences. with this method, the 2-adic complexities of all the known binary sequences with ideal 2-level autocorrelation are determined in a unified way. Results show that their 2-adic complexities equal their periods, which means their 2-adic complexities attain the maximum. Moreover, we determine the 2-adic complexities of some optimal autocorrelation sequences such as Legendre sequences, Ding-Helleseth-Lam sequences and Tang-Ding sequences.