@inproceedings{59f4f959e91744409ed55c6d92e41213,
title = "On the k-Error Linear Complexities of De Bruijn Sequences",
abstract = "We study the k-error linear complexities of de Bruijn sequences. Let n be a positive integer and k be an integer less than ⌈2n-1n⌉. We show that the k-error linear complexity of a de Bruijn sequence of order n is greater than or equal to 2n - 1+ 1, which implies that de Bruijn sequences have good randomness property with respect to the k-error linear complexity. We also study the compactness of some related bounds, and prove that in the case that n≥ 4 and n is a power of 2, there always exists a de Bruijn of order n such that the Hamming weight of L(s) ⊕ R(s) is 2n-1n, where L(s) and R(s) denote respectively the left half and right half of one period of this de Bruijn sequence. Besides, some experimental results are provided for the case that n is not a power of 2.",
keywords = "de Bruijn sequence, k-Error linear complexity, Nonlinear feedback shift register",
author = "Ming Li and Yupeng Jiang and Dongdai Lin",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 16th International Conference on Information Security and Cryptology, Inscrypt 2020 ; Conference date: 11-12-2020 Through 14-12-2020",
year = "2021",
doi = "10.1007/978-3-030-71852-7\_23",
language = "英语",
isbn = "9783030718510",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "344--356",
editor = "Yongdong Wu and Moti Yung",
booktitle = "Information Security and Cryptology - 16th International Conference, Inscrypt 2020, Revised Selected Papers",
address = "德国",
}