Timeline for An efficient generalized algorithm to obtain an arbitrary element of a lexicographically ordered tuple of all balanced $l$-bit binary sequences
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21, 2022 at 15:20 | history | edited | lyrically wicked | CC BY-SA 4.0 |
added 143 characters in body
|
| May 21, 2022 at 14:53 | comment | added | lyrically wicked |
@MaxAlekseyev: but I did not claim that I was presenting the unranking algorithm in its entirety. The SageMath code uses the from_rank function whose underlying algorithm (called “the new unranking algorithm”) is mentioned in footnote 7 on page 12 of the paper.
|
|
| May 21, 2022 at 14:06 | comment | added | Max Alekseyev | It's a generation algorithm, not unranking. So, it's not an answer. | |
| May 21, 2022 at 6:12 | comment | added | lyrically wicked | @kodlu: I added an explanation of how I used these algorithms to obtain the required sequences. | |
| May 21, 2022 at 6:11 | history | edited | lyrically wicked | CC BY-SA 4.0 |
added 659 characters in body
|
| May 20, 2022 at 13:03 | comment | added | kodlu | this probably should be in your question, clarifying it. It's not really an answer. | |
| May 20, 2022 at 5:10 | history | answered | lyrically wicked | CC BY-SA 4.0 |