A Proof of Simmons' Conjecture
- Cite this article as:
- Helleseth, T. & Mykkeltveit, J. Designs, Codes and Cryptography (2004) 33: 39. doi:10.1023/B:DESI.0000032605.98142.7f
- 45 Downloads
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.