Huffman · Adaptive Huffman · Arithmetic (Shannon-Fano · Range)  · Golomb  · Exp-Golomb  · Universal (Elias  · Fibonacci) In computer science and information theory, data compression or source coding is the process of encoding information using fewer bits (or other information-bearing units) than an unencoded representation would use through use of specific encoding schemes. ... Used mainly in object-oriented programming, the term method refers to a piece of code that is exclusively associated either with a class (called class methods, static methods, or factory methods) or with an object (called instance methods). ... Lossless data compression is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. ... A bundle of optical fiber. ... Entropy of a Bernoulli trial as a function of success probability, often called the binary entropy function Entropy is a concept in thermodynamics (see thermodynamic entropy), statistical mechanics and information theory. ... In computer science, the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov-Chaitin complexity, stochastic complexity, algorithmic entropy, or program-size complexity) of an object such as a piece of text is a measure of the computational resources needed to specify the object. ... Redundancy in information theory is the number of bits used to transmit a message minus the number of bits of actual information in the message. ... An entropy encoding is a coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols. ... In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression. ... Adaptive Huffman coding is an adaptive coding technique based on Huffman coding, building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data. ... Arithmetic coding is a method for lossless data compression. ... In the field of data compression, Shannon-Fano coding is a technique for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). ... Range encoding is a form of arithmetic coding, a data compression method, that is believed to be free from arithmetic coding related patents. ... Golomb coding is a form of entropy encoding invented by Solomon W. Golomb that is optimal for alphabets following geometric distributions, that is, when small values are vastly more common than large values. ... An Exponential-Golomb code (or just Exp-Golomb code) of order is a type of universal code, parameterized by a whole number . ... In data compression, a universal code for integers is a prefix-free code that maps the positive integers onto self-delimiting binary codewords, with the additional property that whatever the true probability distribution on integers, the lengths of the codewords are within a constant factor of the lengths that the... Elias gamma code is a universal code encoding the positive integers. ... The Fibonacci code is a universal code which encodes positive integers into binary code words. ...

LPC (LAR · LSP)  · WLPC  · CELP  · ACELP  · A-law  · Mu-law  · MDCT  · Fourier transform  · Psychoacoustic model A dictionary coder, also sometimes known as a substitution coder, is any of a number of data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure (called the dictionary) maintained by the encoder. ... LZ77 and LZ78 are the names for the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978. ... LZW (Lempel-Ziv-Welch) is an implementation of a lossless data compression algorithm created by Abraham Lempel and Jacob Ziv. ... LZO is a data compression algorithm that is focused on decompression speed. ... DEFLATE is a lossless data compression algorithm that uses a combination of the LZ77 algorithm and Huffman coding. ... LZMA, short for Lempel-Ziv-Markov chain-Algorithm, is a data compression algorithm in development since 2001 and used in the 7z format of the 7-Zip archiver. ... LZX is the name of an LZ77 family compression algorithm. ... Run-length encoding (RLE) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. ... The Burrows-Wheeler transform (BWT, also called block-sorting compression), is an algorithm used in data compression techniques such as bzip2. ... PPM is an adaptive statistical data compression technique based on context modeling and prediction. ... Audio compression is a form of data compression designed to reduce the size of audio files. ... Acoustics is a branch of physics and is the study of sound (mechanical waves in gases, liquids, and solids). ... In mathematics and, in particular, functional analysis, convolution is a mathematical operator which takes two functions f and g and produces a third function that in a sense represents the amount of overlap between f and a reversed and translated version of g. ... In signal processing, sampling is the reduction of a continuous signal to a discrete signal. ... The Nyquist–Shannon sampling theorem is a fundamental result in the field of information theory, in particular telecommunications and signal processing. ... An audio codec is a computer program that compresses/decompresses digital audio data according to a given audio file format or streaming audio format. ... Linear predictive coding (LPC) is a tool used mostly in audio signal processing and speech processing for representing the spectral envelope of a digital signal of speech in compressed form, using the information of a linear predictive model. ... Log Area Ratios (LAR) can be used to represent Reflection Coefficients (another from for Linear Prediction Coefficients) for transmission over a channel. ... Line Spectral Pairs (LSP) are used to represent Linear Prediction Coefficients (LPC) for transmission over a channel. ... CELP stands for Code Excited Linear Prediction and is a speech coding algorithm described by the US Federal Standard FIPS 1016. ... Algebraic Code Excited Linear Prediction or ACELP is a speech encoding algorithm where a limited set of pulses is distributed as excitation to linear prediction filter. ... An a-law algorithm is a standard companding algorithm, used in European digital communications systems to optimize, modify, the dynamic range of an analog signal for digitizing. ... In telecommunication, a mu-law algorithm (μ-law) is a standard analog signal compression or companding algorithm, used in digital communications systems of the North American and Japanese digital hierarchies, to optimize, , modify, the dynamic range of an audio analog signal prior to digitizing. ... The modified discrete cosine transform (MDCT) is a Fourier-related transform based on the type-IV discrete cosine transform (DCT-IV), with the additional property of being lapped: it is designed to be performed on consecutive blocks of a larger dataset, where subsequent blocks are overlapped so that the last... In mathematics, the Fourier transform is a certain linear operator that maps functions to other functions. ... Psychoacoustics is the study of subjective human perception of sounds. ...