Category
page 1Coding theory
unary numeral system
the simplest numeral system, a non-positional numeral system
coding theory
study of the properties of codes and their fitness for a specific application according to its environment constraints
Hamming distance
number of bits that differ between two strings
Hamming code
error-correcting code
Reed–Solomon code
error-correcting codes
line code
pattern used within a communications system to represent digital data
linear code
class of error correction code
low-density parity-check code
linear error correcting code
BCH code
error-correcting codes
Shannon's source coding theorem
Data compression theory
Noisy-channel coding theorem
limit on data transfer rate
Hamming weight
number of nonzero symbols in a string
Kraft's inequality
necessary and sufficient condition for the existence of a prefix code for a given set of codeword lengths
prefix code
uniquely decodable code where, given a complete and accurate sequence, a receiver can identify each word without requiring a special marker between words
block code
family of error-correcting codes
Unary coding
Entropy encoding

Singleton bound
upper bound in coding theory
cyclic code
block code where the circular shifts of each codeword gives another word that belongs to the code

binary symmetric channel
common communications channel model used in coding theory and information theory

belief propagation
algorithm
Gibbs' inequality
theorem
Hamming(7,4)
thumb|300px|Graphical depiction of the 4 data bits d1 to d4 and 3 parity bits p1 to p3 and which parity bits apply to which data bits
In coding theory, Hamming(7,4) is a linear error-correcting code that encodes four bits of data into seven bits by adding three parity bits. It is a member of a larger family of Hamming codes, but the term Hamming code often refers to this specific code that Richard W. Hamming introduced in 1950. At the time, Hamming worked at Bell Telephone Laboratories and was frustrated with the error-prone punched card reader, which is why he started working on error-correct
Gilbert–Varshamov bound
in coding theory, a limit on the parameters of a code
Polar code
type of error correcting code

Barker code
mathematical number sequence
erasure code
a forward error correction (FEC) code
Linear network coding
computer Networking Program
Reed–Muller code
error-correcting codes used in wireless communication
Hadamard code
error-correcting code
generator matrix
matrix generating a linear code
decoding method
algorithm to decode messages
Lee distance
string metric
Hamming bound
limit on the parameters of a block code
variable-length code
information theory technique for assigning shorter encoding sequences to more frequently-occurring represented elements
ternary Golay code
error-correcting codes
Binary erasure channel
parity-check matrix
part of coding theory
signed-digit representation
positional numeral system with signed digits; the representation may not be unique
Berlekamp–Welch algorithm
Error correcting algorithm
Canonical Huffman code
particular type of Huffman code with unique properties which allow it to be described in a very compact manner
Goppa code
kind of mathematical linear code
Plotkin bound
limit on the number of codewords in binary codes of given length and minimum distance