Abstract
An open problem posed by Simmons is whether two given permutations of the vertices of the deBruijn graph have the same cycle structure, or not. We present a solution to this problem and find the complete cycle structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.J. Simmons,A pretty,surprising,graph graft,Congressus Numerantium, Vol.144 (2000)pp.113–127.
G.J. Simmons Parity encoding of binary sequences,Designs,Codes and Cryptography, Vol.27 (2002) pp.157–164.
G.J. Simmons,The structure of the differentiation digraphs of binary sequences,Ars Combinatoria, Vol.35-A (1993)pp.71–88.
N. Zierler,Linear recurring sequences,J. Soc. Ind. Appl. Math, Vol.7 (1959)pp.31–48.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Helleseth, T., Mykkeltveit, J. A Proof of Simmons' Conjecture. Designs, Codes and Cryptography 33, 39–43 (2004). https://doi.org/10.1023/B:DESI.0000032605.98142.7f
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000032605.98142.7f