Efficient Composited de Bruijn Sequence Generators

DOI10.1109/TC.2017.2676763MaRDI QIDQ4589511zbMATH OpenFDO

Authors Bo Yang, Kalikinkar Mandal, Guang Gong, Mark D. Aagaard

Publication date 10 November 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cited in

(5)

• On the \(k\)-error linear complexities of De Bruijn sequences
• Longest subsequences shared by two de Bruijn sequences
• The Welch-Gong stream cipher -- evolutionary path
• A BWT-based algorithm for random de Bruijn sequence construction
• On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators

This page was built for publication: Efficient Composited de Bruijn Sequence Generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589511)