Rotating-table games and derivatives of words
From MaRDI portal
Publication:1208719
DOI10.1016/0304-3975(93)90196-ZzbMath0778.90090MaRDI QIDQ1208719
Shlomo Moran, Tuvi Etzion, Reuven Bar Yehuda
Publication date: 16 May 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A generalization of the blind rotating table game, Roulette games and depths of words over finite commutative rings, Spinning switches on a wreath product, Graphs with the unique path property: Structure, cycles, factors, and constructions, Sequences with good correlation property based on depth and interleaving techniques, On the depth spectrum of binary linear codes and their dual
Cites Work
- The Rotating Table
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- An analysis of the structure and complexity of nonlinear binary sequence generators
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- An Operator on Binary Sequences
- Derivatives of Binary Sequences