Algorithm for the generation of nonlinear de Bruijn sequences

MaRDI QIDQ1092907zbMATH OpenFDO

Authors V. N. Dyn'kin, S. S. Musaelyan

Publication date 1987

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

algorithmnonlinear binary sequences

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Review text

We propose an algorithm which for any n generates order of \(2^{n^{2- 5}n}\) nonlinear binary sequences of maximum length \(2^ n\) using approximately \(n^ 2-4n\) bits of memory and at most 2n-2 time cycles for the generation of the next symbol as a function of the n preceding symbols.

Recommendations

• scientific article; zbMATH DE number 500267
• scientific article; zbMATH DE number 123794
• A new algorithm for the generation of binary de Bruijn sequences
• Algorithms for the generation of full-length shift- register sequences
• An efficient algorithm for the generation of DeBruijn cycles

Cited in

(5)

• An efficient algorithm for software generation of binary linear recurrences
• A new algorithm of generating binary M sequences
• scientific article; zbMATH DE number 123794 (Why is no real title available?)
• scientific article; zbMATH DE number 500267 (Why is no real title available?)
• scientific article; zbMATH DE number 221327 (Why is no real title available?)

This page was built for publication: Algorithm for the generation of nonlinear de Bruijn sequences

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