Storage efficient decoding for a class of binary de Bruijn sequences

DOI10.1016/0012-365X(94)00215-5zbMath0817.94008MaRDI QIDQ1842178

Kenneth G. Paterson, Matthew J. B. Robshaw

Publication date: 8 August 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

decoding algorithmde Bruijn sequencebinary sequenceposition sensing

Mathematics Subject Classification ID

Applications of graph theory (05C90) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Parallel algorithms in computer science (68W10)

Related Items (1)

Decoding perfect maps

Cites Work

• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Storage efficient decoding for a class of binary de Bruijn sequences