| A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings |
| |
| 作者姓名： | HU Lei SUN Nigang |
| |
| 作者单位： | State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China |
| |
| 摘 要： | 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, where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.
|
| 关 键 词： | Galois ring highest coordinate sequence linear complexity. |
A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings |
| |
| 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. |
| |
| Authors: | HU Lei SUN Nigang |
| |
| Institution: | State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China |
| |
| Abstract: | 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, where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4. |
| |
| Keywords: | Galois ring highest coordinate sequence linear complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 |
| 点击此处可从《自然科学进展(英文版)》下载免费的PDF全文 |
