首页 | 本学科首页   官方微博 | 高级检索  
     

On GF(p)-linear complexities of binary sequences
引用本文:XU,Li-qing. On GF(p)-linear complexities of binary sequences[J]. 中国邮电高校学报(英文版), 2009, 16(4): 112-115,124. DOI: 10.1016/S1005-8885(08)60257-5
作者姓名:XU  Li-qing
作者单位:Software Engineering Institute, East China Normal University, Shanghai 200062, China 
摘    要:

关 键 词:线性复杂度  二元序列  规划  二进制序列  液晶显示器  几何序列  复杂边界  奇素数
收稿时间:2009-01-03

On GF(p)-linear complexities of binary sequences
XU Li-qing. On GF(p)-linear complexities of binary sequences[J]. The Journal of China Universities of Posts and Telecommunications, 2009, 16(4): 112-115,124. DOI: 10.1016/S1005-8885(08)60257-5
Authors:XU Li-qing
Affiliation:Software Engineering Institute, East China Normal University, Shanghai 200062, China
Abstract:also presented.
Keywords:cryptography  stream cipher  binary sequences  GF(2) linear complexity  GF(p)-Iinear complexity
本文献已被 维普 万方数据 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号