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

摘要

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.