Universal circuit matrix for adjacency graphs of feedback functions

DOI10.1016/0012-365X(94)90294-1zbMath0790.94009MaRDI QIDQ1318845

Jerzy Żurawiecki

Publication date: 4 April 1994

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

zbMATH Keywords

undirected graphsfeedback functionscircuit matrix

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A proof of Golomb's conjecture for the de Bruijn graph
• Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)ⁿ
• Algorithms for the generation of full-length shift- register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
• Double Adjacencies Between Cycles of a Circulating Shift Register

This page was built for publication: Universal circuit matrix for adjacency graphs of feedback functions