On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
Xuan-Yong Zhu, Wen‐Feng Qi · Mathematics of Computation · 2008
We discuss the distinctness problem of the reductions modulo M M of maximal length sequences modulo powers of an odd prime p p , where the integer M M has a prime factor different from p p . For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo M M are distinct. In other words, the reduction modulo M M of a maximal length sequence is proved to contain all the information of the original sequence.