A Proof of Simmons' Conjecture
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- 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.
- A Proof of Simmons' Conjecture
Designs, Codes and Cryptography
Volume 33, Issue 1 , pp 39-43
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- deBruijn graph
- nonlinear shiftregisters
- Industry Sectors