Timeline for "Unbalanced" maximum length sequences?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2015 at 8:56 | answer | added | kodlu | timeline score: 1 | |
| May 13, 2011 at 17:56 | comment | added | darij grinberg | Could you please explain what "passed along an m-sequence for 2m-1 positions" means? Even if 2m-1 should be $2^m-1$, I am still not totally sure about the meaning. As far as I understand, if this is really just the de Bruijn cycle question up to replacing Euler cycles by Euler walks (because you exclude 0000...0 and do not require the path to be a cycle), I wouldn't be surprised if you get slightly unbalanced strings, but they should not be too far from 50-50 for asymptotical counting reasons. | |
| May 13, 2011 at 17:01 | comment | added | Gerhard Paseman | The name De Bruijn comes to mind. Gerhard "Ask Me About System Design" Paseman, 2011.05.13 | |
| May 13, 2011 at 16:11 | comment | added | Or Zuk | Doesn't the fact that each m-bit number appear exactly once forces the sequence to be balanced? (just take the frequency of ones in all non-zero m-bit numbers) | |
| May 13, 2011 at 15:54 | history | asked | user15086 | CC BY-SA 3.0 |