科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article, we present a counterexample to Theorem 4.2 and Theorem 5.2 by Kavuluru (Des Codes Cryptogr 53:75-97, 2009). We conclude that the counting functions for the number of 2 (n) -periodic binary sequences with fixed 3-error linear complexity by Kavuluru are not correct.
