An algorithm for generating shift-register cycles

DOI10.1016/0304-3975(86)90118-0zbMath0601.94008OpenAlexW2030684744MaRDI QIDQ1081585

Tuvi Etzion

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90118-0

zbMATH Keywords

binary sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Self-dual sequences ⋮ Maximal state complexity and generalized de Bruijn words

Cites Work

• Unnamed Item
• A class of nonlinear de Bruijn cycles
• m-ary closed sequences
• Algorithms for the generation of full-length shift- register sequences
• An algorithm for constructing m-ary de Bruijn sequences
• An algebraic construction for q-ary shift register sequences

This page was built for publication: An algorithm for generating shift-register cycles