A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over galois rings
文献类型:期刊论文
作者 | Hu Lei; Sun Nigang |
刊名 | Progress in natural science
![]() |
出版日期 | 2006-09-01 |
卷号 | 16期号:9页码:998-1001 |
关键词 | Galois ring Highest coordinate sequence Linear complexity |
ISSN号 | 1002-0071 |
通讯作者 | Hu lei(hu@is.ac.cn) |
英文摘要 | Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary galois ring of characteristic p(2), where p is a prime. this generalizes the known result of udaya and siddiqi for the case that the galois ring is z(4). |
WOS研究方向 | Materials Science ; Science & Technology - Other Topics |
WOS类目 | Materials Science, Multidisciplinary ; Multidisciplinary Sciences |
语种 | 英语 |
WOS记录号 | WOS:000242122100016 |
出版者 | TAYLOR & FRANCIS LTD |
URI标识 | http://www.irgrid.ac.cn/handle/1471x/2379780 |
专题 | 中国科学院大学 |
通讯作者 | Hu Lei |
作者单位 | Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China |
推荐引用方式 GB/T 7714 | Hu Lei,Sun Nigang. A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over galois rings[J]. Progress in natural science,2006,16(9):998-1001. |
APA | Hu Lei,&Sun Nigang.(2006).A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over galois rings.Progress in natural science,16(9),998-1001. |
MLA | Hu Lei,et al."A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over galois rings".Progress in natural science 16.9(2006):998-1001. |
入库方式: iSwitch采集
来源:中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。