On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two

DOI10.1007/11423461_11zbMath1145.94426OpenAlexW1592427283MaRDI QIDQ5450824

Publication date: 14 March 2008

Published in: Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11423461_11

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

This page was built for publication: On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two