I'm trying to find a way to compress a list of integers (16 bit). The list has a few particularities:
- always 48 numbers in the list
- all integers (none above 65536)
- the sum of all numbers will never be above 65536 (I feel this could be key in making the compressed value take up little room)
- 0 might naturally occur more often as a value, but all should be considered random.
I want to compress these so I can decompress without loss of precision. Is there something better than a list of 96 chars (which is no compression at all)?