On the distinctness of modular reductions of maximal length sequences modulo odd prime powers

被引：25
|
作者：
Zhu, Xuan-Yong [1 ]
Qi, Wen-Feng [2 ]
机构：
[1] China Natl Digital Switching Syst Engn & Technol, Zhengzhou 450002, Peoples R China
[2] Zhengzhou Informat Engn Univ, Dept Appl Math, Zhengzhou 450002, Peoples R China
来源：
MATHEMATICS OF COMPUTATION | 2008年 / 77卷 / 263期
关键词：
integer residue ring; linear recurring sequence; primitive polynomial; primitive sequence; modular reduction;
D O I：
10.1090/S0025-5718-08-02075-9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We discuss the distinctness problem of the reductions modulo M of maximal length sequences modulo powers of an odd prime p, where the integer M has a prime factor different from p. For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo M are distinct. In other words, the reduction modulo M of a maximal length sequence is proved to contain all the information of the original sequence.
引用
收藏
页码：1623 / 1637
页数：15
相关论文
共 31 条
1234