Timeline for Optimal DC-free line encoding
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16, 2013 at 23:11 | comment | added | pichenettes | I have added an explanation for the case n = 6. It's hard to share how intuitive this looks to me - it's a bit like the steps required to convert a number into base 2, except that instead of decomposing into a sum of powers of 2, we decompose into a sum of binomial coefficients which depend on the number of 1 and 0 we have written so far. | |
| Jan 16, 2013 at 23:09 | history | edited | pichenettes | CC BY-SA 3.0 |
added 2640 characters in body
|
| Jan 16, 2013 at 21:58 | comment | added | Dan Sandberg | Wow, impressive! I've accepted this as the answer. I agree that I might want to re-post elsewhere -- I wasn't sure whether to post this on math or cs or dsp. Can you give a super high-level explanation of how the code works? I'm looking at it but I'm not grokking the list comprehensions and big picture idea. Thanks! | |
| Jan 16, 2013 at 21:52 | vote | accept | Dan Sandberg | ||
| Jan 16, 2013 at 20:43 | history | edited | pichenettes | CC BY-SA 3.0 |
Reworked my solution to use a lookup table for binomial coefficients
|
| Jan 16, 2013 at 20:33 | history | edited | pichenettes | CC BY-SA 3.0 |
deleted 71 characters in body
|
| Jan 16, 2013 at 20:21 | history | edited | pichenettes | CC BY-SA 3.0 |
added 3 characters in body
|
| Jan 16, 2013 at 20:12 | history | answered | pichenettes | CC BY-SA 3.0 |