(ML 2.5) Generalizations for trees (CART)

(ML 2.4) Growing a classification tree (CART)

(IC 5.14) Finite-precision arithmetic coding - Decoder

(IC 5.13) Finite-precision arithmetic coding - Encoder

(IC 5.12) Finite-precision arithmetic coding - Setup

(IC 5.11) Finite-precision arithmetic coding - Rescaling

(IC 5.10) Generalizing arithmetic coding to non-i.i.d. models

(IC 5.9) Computational complexity of arithmetic coding

(IC 5.8) Near optimality of arithmetic coding

(IC 5.7) Decoder for arithmetic coding (infinite-precision)

(IC 5.4) Why the interval needs to be completely contained

(IC 5.6) Encoder for arithmetic coding (infinite-precision)

(IC 5.5) Rescaling operations for arithmetic coding

(IC 5.3) Arithmetic coding - Example #2

(IC 5.2) Arithmetic coding - Example #1

(IC 5.1) Arithmetic coding - introduction

(IC 4.12) Optimality of Huffman codes (part 7) - existence

(IC 4.13) Not every optimal prefix code is Huffman

(IC 4.11) Optimality of Huffman codes (part 6) - induction

(IC 4.10) Optimality of Huffman codes (part 5) - extension lemma

(IC 4.9) Optimality of Huffman codes (part 4) - extension and contraction

(IC 4.8) Optimality of Huffman codes (part 3) - sibling codes

(IC 4.7) Optimality of Huffman codes (part 2) - weak siblings

(IC 4.6) Optimality of Huffman codes (part 1) - inverse ordering

(IC 4.5) An issue with Huffman coding

(IC 4.4) Weighted minimization with Huffman coding

(IC 4.3) B-ary Huffman codes

(IC 4.2) Huffman coding - more examples

(IC 4.1) Huffman coding - introduction and example

(IC 3.10) Relative entropy as the mismatch inefficiency