A correction to: on the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences
Designs, Codes and Cryptography(2019)
摘要
In the paper of Kyureghyan and Pott (Des Codes Cryptogr 29:149–164, 2003), the linear feedback polynomials of the Sidelnikov–Lempel–Cohn–Eastman sequences were determined for some special cases. We found that Corollary 4 and Theorem 2 of that paper are wrong because there exist counterexamples for these two results. In this note, we give some counterexamples of Corollary 4 and Theorem 2, and correct them by readopting the negation of the condition of Lemma 5 as their necessary and sufficient conditions.
更多查看译文
关键词
Linear feedback polynomial, Linear complexity, The Sidelnikov–Lempel–Cohn–Eastman sequences, Jacobsthal sums, 94A55
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络