A formula on linear complexity of highest coordinate sequences from maximal periodic seque

A formula on linear complexity of highest coordinate sequences from maximal periodic

sequences over Galois rings

HU Lei;SUN Nigang

【期刊名称】《自然科学进展（英文版）》 【年(卷),期】2006(016)009

【摘要】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 p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.

【总页数】4页(998-1001)

【关键词】Galois ring;highest coordinate sequence;linear complexity 【作者】HU Lei;SUN Nigang

【作者单位】State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China;State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China 【正文语种】中文 【中图分类】O1 【相关文献】