| 周期序列的k错线性复杂度的期望值 |
| |
| 作者姓名： | 吴成文 岳勤 |
| |
| 作者单位： | 南京航空航天大学数学系, 南京 210016 |
| |
| 基金项目： | Supported by NNSF of China (11171150,10971250) |
| |
| 摘 要： | 有限域Fq上一个周期序列的k错线性复杂度被定义为通过改变每个周期至多k个比特所得到的最小线性复杂度. 给出有限域Fq上pn周期序列的k错线性复杂度的期望,其中p是一个奇素数,q是模p2的原根,并且1≤k≤(p-1)/2.
|
| 关 键 词： | 线性复杂度 k错线性复杂度 期望值 |
| 收稿时间： | 2010-10-15 |
| 修稿时间： | 2011-05-20 |
Expected value of k-error linear complexity of periodic sequences |
| |
| Authors: | WU Cheng-Wen YUE Qin |
| |
| Institution: | Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China |
| |
| Abstract: | The k-error linear complexity of a periodic sequence over a finite field Fq is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits per period. We explicitly give the expected value of k-error linear complexity of pn-periodic sequences over Fq, where p is an odd prime, q is a prime primitive root modulo p2, and 1≤k≤(p－1)/2. |
| |
| Keywords: | linear complexity k-error linear complexity" target="_blank">k-error linear complexity')">k-error linear complexity expected value |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
|
