Coding theory Coding theory is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error-correction and more recently also for netwo... Coding theory - Wikipedia
 Coding theory - Wikipedia
 Character encoding In computing, a character encoding is used to represent a repertoire of characters by some kind of an encoding system. Depending on the abstraction level and context, corresponding code points and the...
 Data compression In digital signal processing, data compression, source coding,or bit-rate reduction involves encoding information using fewer bits than the original representation. Compression can be either lossy or...
 Data differencing In computer science and information theory, data differencing or differential compression is producing a technical description of the difference between two sets of data – a source and a target. Forma...
 Error detection and correction In information theory and coding theory with applications in computer science and telecommunication, error detection and correction or error control are techniques that enable reliable delivery of dig...
 Linear code In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally partitioned into block codes and convolutio...
 Block code In coding theory, a block code is any member of the large and important family of error-correcting codes that encode data in blocks.There is a vast number of examples for block codes, many of which ha...
 Convolutional code In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding ... Convolutional code - Wikipedia
 Neural coding Neural coding is a neuroscience-related field concerned with characterizing the relationship between the stimulus and the individual or ensemble neuronal responses and the relationship among the elect... Neural coding - Wikipedia
 Coding theorists
 Intra frame Intra-frame coding is used in video coding (compression). It is part of an intra-frame codec like ProRes: a group of pictures codec with inter frames.The term intra-frame coding refers to the fact tha...
 Factorization of polynomials over finite fields
 Bar product In information theory, the bar product of two linear codes C2 ⊆ C1 is defined aswhere (a | b) denotes the concatenation of a and b. If the code words in C1 are of length n, then th...
 Gilbert–Varshamov bound In coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert and independently Rom Varshamov) is a limit on the parameters of a (not necessarily linear) code. It is occasionally known as the Gi... Gilbert–Varshamov bound - Wikipedia
 Tornado code In computer science, Tornado codes are a class of erasure codes that support error correction. Tornado codes require a constant C more redundant blocks than the more data-efficient Reed–Solomon erasu...
 DriveSpace DriveSpace (initially known as DoubleSpace) is a disk compression utility supplied with MS-DOS starting from version 6.0. The purpose of DriveSpace is to increase the amount of data the user could sto...
 Minimum distance The term minimum distance may refer to
 Raptor code In computer science, raptor codes (rapid tornado; see Tornado codes) are the first known class of fountain codes with linear time encoding and decoding. They were invented by Amin Shokrollahi in 2000/...
 Reed–Solomon error correction Reed–Solomon codes are an important group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960.They have many important applications, the most prominent of whic... Reed–Solomon error correction - Wikipedia
 Covering radius In the mathematical theory of metric spaces, ε-nets, ε-packings, ε-coverings, uniformly discrete sets, relatively dense sets, and Delone sets (named after Boris Delone) are several closely related def...
 Progressive Graphics File PGF (Progressive Graphics File) is a wavelet-based bitmapped image format that employs lossless and lossy data compression. PGF was created to improve upon and replace the JPEG format. It was develope...
 AVC-Intra AVC-Intra is a type of video coding developed by Panasonic, and then supported in products made by other companies.AVC-Intra is available in Panasonic's high definition broadcast products, such as, fo...
 Parity-check matrix In coding theory, a parity-check matrix of a linear block code Cis a matrix which describes the linear relations that the components of a codeword must satisfy. It can be used to decide if a particula...
 Linear network coding Linear network coding is a technique which can be used to improve a network's throughput, efficiency and scalability, as well as resilience to attacks and eavesdropping. Instead of simply relaying the...
 HTML decimal character rendering HTML (Hypertext Markup Language) has been in use since 1991, but HTML 4.0 (December 1997) was the first standardized version where international characters were given reasonably complete treatment. Wh...
 Covering code In coding theory, a covering code is a set of elements (called codewords) in a space, with the property that every element of the space is within a fixed distance of some codeword.Let , , be int...
 Unicode Unicode is a computing industry standard for the consistent encoding, representation, and handling of text expressed in most of the world's writing systems. Developed in conjunction with the Universal... Unicode - Wikipedia
 Extended ASCII Extended ASCII (or high ASCII) is eight-bit or larger character encodings that include the standard seven-bit ASCII characters as well as others. The use of the term is sometimes criticized, because ...
 ASCII ASCII (/ˈæski/ ASS-kee), abbreviated from American Standard Code for Information Interchange, is a character-encoding scheme. Originally based on the English alphabet, it encodes 128 specified charact... ASCII - Wikipedia
 Zemor's decoding algorithm In coding theory, Zemor's algorithm, designed and developed by Gilles Zemor, is a recursive low-complexity approach to code construction. It is an improvement over the algorithm of Sipser and Spielma... Zemor's decoding algorithm - Wikipedia