Category

Error detection and correction

page 1

error detection and correction

techniques that enable reliable delivery of digital data over unreliable communication channels

bit added to a binary string to ensure that the sum of the bit values is even or odd; used as an error detecting code

study of the properties of codes and their fitness for a specific application according to its environment constraints

square array with symbols that each occur once per row and column

error-correcting code

simple checksum formula

message authentication code

keyed hash function used to protect a message's integrity and authenticity

tree data structure whose nodes are recursively cryptographically hashed

Reed–Solomon code

error-correcting codes

error detection for identification numbers

error correction code

scheme for controlling errors in data over noisy communication channels

Viterbi algorithm

high-performance forward error correction codes

Casting out nines

low-density parity-check code

linear error correcting code

convolutional code

type of error-correcting code using convolution

forward error correction

technique for controlling errors in data transmission

error-correcting codes

automatic repeat request

error-control method for data transmission

crew resource management

aircrew training concept to improve communication and decision-making

binary Golay code

error-correcting code used in digital communications

automatic repeat-request (ARQ) protocol in data transmission and error detection

Berlekamp–Massey algorithm

test to check if a hypothesis is rational

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

acknowledgement

computing signal confirming receipt of a message

Longitudinal redundancy check

error detection number calculated over a serial data stream

type of error correcting code

group coded recording

several distinct but related encoding methods for magnetic media

Reed–Muller code

error-correcting codes used in wireless communication

Triple modular redundancy

redundancy using three systems and voting to determine the result

forward–backward algorithm

hidden Markov model inference algorithm which computes the posterior marginals of all hidden state variables given a sequence of observations, making use of dynamic programming to make only 2 passes: one forward, one backward

Message authentication

in information security

error-correcting code

stop-and-wait ARQ

basic automatic repeat-request (ARQ) data transmission and error detection protocol

Hybrid automatic repeat request

hybrid error-detection and correction code in communications

Error correction model

type of time series model

Berlekamp–Welch algorithm

Error correcting algorithm

Selective Repeat ARQ

automatic repeat-request (ARQ) data transmission and error correction protocol