1 Erratum to: AAECC (2013) 24:497–505 DOI 10.1007/s00200-013-0210-3
We are so sorry to point out that the results in our paper “On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences” are very similar to the results in [1], which was written in Chinese. But when we wrote this paper we had never read [1] before, even the papers we read didn’t cite [1]. This is totally a coincidence. It is mainly because the technique we used is both from [2, 3]. But [1] had been published earlier in 2004; it is our negligence. We are terribly sorry to the authors of [1] and even more to this reputed journal.
References
Bai, E., Liu, X., Xiao, G.: A fast algorithm for determining k-error linear complexity profile of a binary sequence with period \(p^{n}\). J. China Inst. Commun. 25(10), 1–7 (2004) (in Chinese)
Lauder, A., Paterson, K.: Computing the error linear complexity spectrum of a binary sequence of period \(2^{n}\). IEEE Trans. Inform. Theory 49(1), 273–280 (2003)
Xiao, G., Wei, S., Lam, K.Y., Imamura, K.: A fast algorithm for determining the linear complexity of a sequence with period \(p^{n}\) over GF(\(q\)). IEEE Trans. Inform. Theory 46(6), 2203–2206 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
The online version of the original article can be found under doi:10.1007/s00200-013-0210-3.
Rights and permissions
About this article
Cite this article
Tang, M., Zhu, S. Erratum to: On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences. AAECC 25, 225 (2014). https://doi.org/10.1007/s00200-014-0221-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-014-0221-8