Timeline for Can more compression be achieved when data is sorted (in ascending or descending order)?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2021 at 15:20 | comment | added | ShAr | Maybe by sorting according to frequency of occurrence to assign shorter codes to higher frequencies (Huffman coding, or Hu-Tucker according to whether to keep original order) | |
| Sep 18, 2021 at 14:42 | vote | accept | Akash | ||
| Sep 17, 2021 at 22:29 | answer | added | Phillip Williams | timeline score: 2 | |
| Sep 17, 2021 at 20:36 | answer | added | ShAr | timeline score: 0 | |
| Sep 16, 2021 at 21:57 | comment | added | Criticizing Israel not allowed | There is no magic secret to compress a file down to a certain size. | |
| Sep 16, 2021 at 16:39 | history | edited | Akash | CC BY-SA 4.0 |
added 24 characters in body
|
| Sep 16, 2021 at 16:33 | history | edited | Akash | CC BY-SA 4.0 |
added 180 characters in body
|
| Sep 16, 2021 at 16:22 | history | asked | Akash | CC BY-SA 4.0 |