报告人 | 曾祥勇 |
举办单位 | 科技处、学科办、研究生处、数统学院 |
报告题目 | Binary sequences with length n and nonlinear complexity not less than n/2 |
报告时间 | 2022年12月4日 19：00 |
报告地点 | 腾讯最火的网赌app议804-649-887 |
报告人所属单位 | 湖北大学 |
报告人职称/职务 | 二级教授，博士生导师，数学与统计学学院院长 |
报告内容简介 | Pseudorandom sequences are widely used in cryptography, coding theory and combinatorial design. In this talk, we will focus on binary sequences with length n and nonlinear complexity not less than n/2. By characterizing the general structure of these sequences, we propose a direct construction for these sequences, and establish a formula to calculate the exact number of such sequences. |
上一篇：下一篇：