|
|
|
|
|
|
by ignoramous
1596 days ago
|
|
|
Thanks. RLE is a hit-and-a-miss (101010101010 etc); top-k is heuristic-based. Those are viable solutions, nevertheless (esp, top-k). Puny Code, which DNS uses, I thought was pretty neat for fitting in a state-machine in printable characters. Takes a bunch of CPU resources to restore it, though. I was wondering if there are other techniques that I may not be aware of. |
|
|