About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 75. Chapters: Huffman coding, Lossless data compression, Arithmetic coding, Run-length encoding, Lempel-Ziv-Welch, Entropy encoding, DEFLATE, Burrows-Wheeler transform, Shannon-Fano coding, LZ77 and LZ78, PackBits, Bzip2, Fibonacci coding, Elias gamma coding, Prefix code, Elias delta coding, Range encoding, Golomb coding, Delta encoding, PAQ, Lossless JPEG, Lempel-Ziv-Markov chain algorithm, Dynamic Markov compression, JBIG2, Variable-length code, Universal code, MrSID, Move-to-front transform, HTTP compression, Package-merge algorithm, Dictionary coder, Truncated binary encoding, Liblzg, FreeArc, Prediction by partial matching, Canonical Huffman code, LEB128, Embedded Zerotrees of Wavelet transforms, Adam7 algorithm, Elias omega coding, Adaptive Huffman coding, Adaptive coding, FELICS, LZX, Lempel-Ziv-Stac, Statistical Lempel Ziv, Huffyuv, SheerVideo, LZWL, NegaFibonacci coding, Lempel-Ziv-Storer-Szymanski, Exponential-Golomb coding, Unary coding, Context-adaptive binary arithmetic coding, Lempel-Ziv-Oberhumer, CCSDS 122.0-B-1, Incremental encoding, Levenstein coding, Microsoft Point-to-Point Compression, Chain code, Lagarith, Incompressible string, Recursive indexing, Sequitur algorithm, Byte pair encoding, Context-adaptive variable-length coding, Context tree weighting, Algorithm BSTW, MSU Lossless Video Codec, LZRW, LZJB, Modified Huffman coding, QUAD. Excerpt: Arithmetic coding is a form of variable-length entropy encoding used in lossless data compression. Normally, a string of characters such as the words "hello there" is represented using a fixed number of bits per character, as in the ASCII code. When a string is converted to arithmetic encoding, frequently used characters will be stored with fewer bits and not-so-frequently occurring characters will be stored with more bits, resulting in fewer bits used in total. Arithm...
