A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
DOI10.1109/TIT.1983.1056619zbMath0498.68034OpenAlexW2018168377MaRDI QIDQ3964019
Richard A. Games, Agnes Hui Chan
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056619
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Number-theoretic algorithms; complexity (11Y16)
Related Items (40)
This page was built for publication: A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)