by

Wikipedia Bot (@wikibot, 0)

Error detection and correction

Table of contents

Capacity-achieving codes

 0  0 

Capacity-approaching codes

 0  0 

Hash functions

 0  0 

Message authentication codes

 0  0 

AN codes

 0  0 

Acknowledgement (data networks)

 0  0 

Alternant code

 0  0 

Automated quality control of meteorological observations

 0  0 

Automatic repeat request

 0  0 

BCH code

 0  0 

BCJR algorithm

 0  0 

Berger code

 0  0 

Berlekamp–Massey algorithm

 0  0 

Berlekamp–Welch algorithm

 0  0 

Binary Golay code

 0  0 

Binary Reed–Solomon encoding

 0  0 

Bipolar violation

 0  0 

Burst error-correcting code

 0  0 

Casting out nines

 0  0 

Check digit

 0  0 

Chien search

 0  0 

Chipkill

 0  0 

Coding gain

 0  0 

Coding theory

 0  0 

Concatenated error correction code

 0  0 

Confidential incident reporting

 0  0 

Constant-weight code

 0  0 

Convolutional code

 0  0 

Coset leader

 0  0 

Cosine error

 0  0 

Crew resource management

 0  0 

Cross-interleaved Reed–Solomon coding

 0  0 

Data Integrity Field

 0  0 

Data scrubbing

 0  0 

Delsarte–Goethals code

 0  0 

Detection error tradeoff

 0  0 

Drop-out compensator

 0  0 

Dual modular redundancy

 0  0 

EXIT chart

 0  0 

Echo (computing)

 0  0 

Error-correcting codes with feedback

 0  0 

Error concealment

 0  0 

Error correction code

 1  0 

Error correction mode

 0  0 

Error correction model

 0  0 

Error floor

 0  0 

Error management theory

 0  0 

Expander code

 0  0 

File verification

 0  0 

Folded Reed–Solomon code

 0  0 

Forney algorithm

 0  0 

Forward–backward algorithm

 0  0 

Generalized minimum-distance decoding

 0  0 

Go-Back-N ARQ

 0  0 

Group coded recording

 0  0 

Hadamard code

 0  0 

Hagelbarger code

 0  0 

Hamming(7,4)

 0  0 

Hamming code

 0  0 

Hash calendar

 0  0 

Hash list

 0  0 

Header check sequence

 0  0 

Homomorphic signatures for network coding

 0  0 

Hybrid automatic repeat request

 0  0 

Internet checksum

 0  0 

Introduction to the Theory of Error-Correcting Codes

 0  0 

Iterative Viterbi decoding

 0  0 

Justesen code

 0  0 

K-independent hashing

 0  0 

Latin square

 0  0 

Lexicographic code

 0  0 

List decoding

 0  0 

Locally decodable code

 0  0 

Locally testable code

 0  0 

Long code (mathematics)

 0  0 

Longitudinal redundancy check

 0  0 

Low-density parity-check code

 1  0 

Majority logic decoding

 0  0 

Maximum likelihood sequence estimation

 0  0 

Memory ProteXion

 0  0 

Merkle tree

 1  0 

Message authentication

 0  0 

Message authentication code

 1  0 

Multidimensional parity-check code

 0  0 

Parity bit

 0  0 

Parvaresh–Vardy code

 0  0 

Pearson hashing

 0  0 

Permutation codes

 0  0 

Polar code (coding theory)

 0  0 

Preparata code

 0  0 

Pseudo bit error ratio

 0  0 

Rank error-correcting code

 0  0 

Redundant array of independent memory

 0  0 

Reed–Muller code

 0  0 

Reed–Solomon error correction

 0  0 

Reliable Data Transfer

 0  0 

Remote error indication

 0  0 

Repeat-accumulate code

 0  0 

Repetition code

 0  0 

Residual bit error rate

 0  0 

 Articles were limited to the first 100 out of 123 total. Click here to view all children of Error detection and correction.

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version