AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Aysmptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Discrete Applied Mathematics - Special double volume: interconnection networks
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Shortest Feedback Shift Register That Can Generate A Given Sequence
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |
Let s = (s1, s2, ..., sn) be a sequence of characters where si Ɛ Zp for 1 ≤ i ≤ n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s [17, 18]. We provide a proof that the expected length of the shortest feedback register to generate a sequence of length n is less than 2 logp, n + o(1), and also give several other statistics of interest for distinguishing random strings. The proof is based on relating the maximum order complexity to a data structure known as a suflix tree.