scientific article; zbMATH DE number 844162

MaRDI QIDQ4865147zbMATHFDO

Authors Paweł Wlaź, Jerzy Żurawiecki

Publication date 13 February 1996

zbMATH Keywords

spanning treesalgorithmuniversal circuit matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A new algorithm of generating binary \(M\) sequences
• An algorithm for generating \(M\)-sequences using the amalgamation-circles method in \(F_2\)
• Generalization of \(m\)-sequences and fast generation of a class of \(M\)- sequences
• scientific article; zbMATH DE number 3947494
• scientific article; zbMATH DE number 1148334
• On the synthesis of some types of circuits based on translation partitions generated by universal matrices
• An algorithm for constructing m-ary de Bruijn sequences
• A construction of digital \((0,s)\)-sequences involving finite-row generator matrices
• Algorithms for the generation of full-length shift- register sequences
• A generalized Euclidean algorithm for multisequence shift-register synthesis

This page was built for publication:

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