On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs

DOI10.1007/978-981-13-0023-3_11zbMath1459.05152OpenAlexW2796514008MaRDI QIDQ5114859

Srinivasan Krishnaswamy, Suman Roy, P. Vinod Kumar

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_11

zbMATH Keywords

de Bruijn graphde Bruijn sequencesshift registerpseudorandom sequence generator

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A Bijective Proof of a Theorem of Knuth
• On cross joining de Bruijn sequences
• Algorithms for the generation of full-length shift- register sequences
• Shift Register Sequences – A Retrospective Account
• 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

This page was built for publication: On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs