This is a list of
algebraic coding theory topics.
{,
, valign="top" ,
*
ARQ
*
Adler-32
*
BCH code
*
BCJR algorithm
*
Belief propagation
*
Berger code In telecommunication, a Berger code is a unidirectional error detection and correction, error detecting code, named after its inventor, J. M. Berger. Berger codes can detect all unidirectional errors. Unidirectional errors are errors that only flip ...
*
Berlekamp–Massey algorithm
*
Binary Golay code
In mathematics and electronics engineering, a binary Golay code is a type of linear error-correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a particularly deep and interesting connection ...
*
Bipolar violation
*
CRHF
*
Casting out nines
*
Check digit
*
Chien's search
*
Chipkill __NOTOC__
Chipkill is IBM's trademark for a form of advanced error checking and correcting (ECC) computer memory technology that protects computer memory systems from any single memory chip failure as well as multi-bit errors from any portion of a ...
*
Cksum
*
Coding gain
*
Coding theory
*
Constant-weight code
*
Convolutional code
*
Cross R-S code
*
Cryptographic hash function
*
Cyclic redundancy check
A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short ''check value'' attached, based on t ...
*
Damm algorithm
*
Dual code
*
EXIT chart
*
Error-correcting code
In computing, telecommunication, information theory, and coding theory, an error correction code, sometimes error correcting code, (ECC) is used for controlling errors in data over unreliable or noisy communication channels. The central idea is ...
*
Enumerator polynomial
*
Fletcher's checksum
,
,
, valign="top" ,
* Forward error correction
In computing, telecommunication, information theory, and coding theory, an error correction code, sometimes error correcting code, (ECC) is used for controlling errors in data over unreliable or noisy communication channels. The central idea is ...
* Forward-backward algorithm
* Gilbert–Varshamov bound
* Goppa code
* GOST (hash function)
* Group coded recording
* HAS-160
* HAS-V
* HAVAL
* Hadamard code
* Hagelbarger code
In telecommunication, a Hagelbarger code is a convolutional code that enables error bursts to be corrected provided that there are relatively long error-free intervals between the error bursts.
In the Hagelbarger code, inserted parity check bit ...
* Hamming bound
* Hamming code
In computer science and telecommunication, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors, or correct one-bit errors without detection of uncorrected errors. By contrast, the sim ...
* Hamming(7,4)
* Hamming distance
* Hamming weight
* Hash collision
In computer science, a hash collision or hash clash is when two pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits.
Al ...
* Hash function
* Hash list
* Hash tree
* Induction puzzles
* Integrity check value
* Interleaving
Interleaving may refer to:
* Interleaving, a technique for making forward error correction more robust with respect to burst errors
* An optical interleaver, a fiber-optic device to combine two sets of dense wavelength-division multiplexing (DW ...
* ISBN
* ISMN
* LM hash
* Lexicographic code
, ,
, valign="top" ,
* Linear code
* Link adaptation
* Low-density parity-check
* Luhn algorithm
* Luhn mod N algorithm
* M of n codes
* MD2
* MD4
* MD5
* MDC-2
* Majority logic decoding
* McWilliams identity
* Md5sum
* Merkle–Damgård construction
* N-Hash
* Negative-acknowledge character
* One-way compression function
* Parity bit
A parity bit, or check bit, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. Parity bits are generally applied to the smallest units of a communication protocol, typically 8-bit octets (bytes) ...
* Pearson hashing
* Perfect code
* Quantum fingerprinting
* RIPEMD
* Random oracle
In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every ''unique query'' with a (truly) random response chosen uniformly from its output domain. If a query is repeated, it responds the same way every time th ...
* Redundancy check
* Reed–Solomon code
* Reed–Solomon error correction
Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960.
They have many applications, the most prominent of which include consumer technologies such as MiniDiscs, CDs, DVDs, B ...
* Repeat-accumulate code
, ,
, valign="top" ,
* Repetition code
* SEC-DED
* SFV
* SHA-1
* SHA-2
* Sanity testing
* Shaping codes
* Singleton bound
* Snake-in-the-box
* Snefru
* Soft output Viterbi algorithm
* Sparse graph code
* Syndrome decoding
* Tanner graph
* Ternary Golay code
* Tiger (hash function)
* Transverse redundancy check
In telecommunications, a transverse redundancy check (TRC) or vertical redundancy check is a redundancy check for synchronized parallel bits applied once per bit time, across the bit streams. This requires additional parallel channels for the chec ...
* Triple modular redundancy
* Turbo code
* UOWHF
In cryptography a universal one-way hash function (UOWHF, often pronounced "woof"), is a type of universal hash function of particular importance to cryptography. UOWHF's are proposed as an alternative to collision-resistant hash functions (CRH ...
* Universal hashing
* Universal Product Code
* Verhoeff algorithm
* Viterbi algorithm
* Viterbi decoder
A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been
encoded using a convolutional code or trellis code.
There are other algorithms for decoding a convolutionally encoded stream (for example, the Fano algorithm). Th ...
* WHIRLPOOL
Algebraic coding theory