3 ms·
Bit packing in the normal fashion as in the article - where you assume an exact bit length for all elements - isn't normally optimal. Arithmetic coding can use
by barrkel 14y ago
Bit packing in the normal fashion as in the article - where you assume an exact bit length for all elements - isn't normally optimal. Arithmetic coding can use fractional bits, but bit backing forces you to a power of 2 domain.
- csense 14y agoA real compression algorithm experiences its gain due to low-entropy distribution of the input values. If your input is randomly distributed integers in the interval [0, 2^n), a bit-packed coding is the most efficient possible.