A counterexample concerning the 3-error linear complexity of 2
n
-periodic binary sequences |
| |
| Authors: | Jianqin Zhou |
| |
| Institution: | 1. Telecommunication School, Hangzhou Dianzi University, Hangzhou, 310018, China
2. Computer Science School, Anhui Univversity of Technology, Ma’anshan, 243032, China
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
