Timeline for With only two characters allowed, is it possible to efficiently reference a 256 character alphabet in a string?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2020 at 12:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 15, 2020 at 11:31 | answer | added | Mattias Andersson | timeline score: 1 | |
| Jan 13, 2020 at 8:30 | comment | added | Benoît Kloeckner | Your question is imprecise: what do you mean by "efficient"? However I feel there could be a good question with a clean answer behind the current formulation. If you want to ensure frequent characters are assigned a short string (e.g. for compression purposes), an important keyword is entropy. It gives a lower bound on the average length you can achieve. E.g. if the characters all have the same frequency, you cannot do better than encode them all with 8 bits. | |
| Jan 13, 2020 at 7:01 | comment | added | Bane Williams | Thanks for the retag, I was super not certain of which category to put this in. | |
| Jan 13, 2020 at 6:40 | history | edited | David Roberts♦ |
edited tags
|
|
| Jan 13, 2020 at 6:40 | comment | added | David Roberts♦ | This is not number theory, I'm afraid. I'm re-tagging. I'm not sure this is even on-topic; there is always math.stackexchange.com if this gets closed here. | |
| Jan 13, 2020 at 6:35 | review | First posts | |||
| Jan 13, 2020 at 7:11 | |||||
| Jan 13, 2020 at 6:31 | history | asked | Bane Williams | CC BY-SA 4.0 |