Timeline for What is the optimal binary encoding of the elements of a monoid?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Jul 23, 2015 at 9:07 | comment | added | Klaus Draeger | It seems to be trickier than that, since if $M$ is non-free, its elements need not have a unique representation, i.e. you are looking for both an encoding of $S$ and a choice of representation. | |
| Jul 23, 2015 at 8:12 | history | tweeted | twitter.com/#!/StackCSTheory/status/624129896315490304 | ||
| Jul 23, 2015 at 7:05 | comment | added | Suresh Venkat | Since your monoid is finite, this seems like a variant of Huffman coding. Write down the representation of each element of M in terms of S, look at the frequency with which each element of S shows up, build a Huffman code from that frequency list, and then use that to encode the elements of S. I just realized that you also need to choose S, but this is a way to optimize phi for any fixed S. | |
| Jul 23, 2015 at 1:06 | review | First posts | |||
| Jul 23, 2015 at 8:55 | |||||
| Jul 23, 2015 at 1:04 | history | asked | Orby | CC BY-SA 3.0 |