Given that the bit is the unit of stored data, it appears impossible for codewords to occupy fractional bits. And given that a minimum-redundancy code as described in Chapter 4 is the best that can be done using integral-length codewords, it would thus appear that a minimum-redundancy code obtains compression as close to the entropy as can be achieved.
KeywordsCode Algorithm Arithmetic Code Integer Arithmetic Codeword Length Binary Arithmetic
Unable to display preview. Download preview PDF.