Encyclopedia > Error-correction

  Article Content

Error-correction

In computer science and information theory, error-correction consists of methods to detect and correct errors in the transmission or storage of data by the use of some amount of redundant data and (in the case of transmission) the selective retransmission of incorrect segments of that data.

Error-correction methods are chosen depending on the error characteristics of the transmission or storage medium, such that errors are almost always detected and corrected with a minimum of redundant data stored or sent.

The most obvious (and highly inefficient) method of error-correction is to repeat each unit of data multiple times. Another simple method is to use one bit of each byte of data as a parity bit. Note, however, that this only provides error-detection, and not error-correction: if an error occurs, we do not know which bit is in error.

Information theory tells us that whatever be the probability of error in transmission or storage, it is possible to construct error-correcting codes in which the likelihood of failure is arbitrarily low. It gives a bound on the efficiency that such schemes can achieve.

Error-correction in practice is complicated by the fact that errors might occur in bursts rather than at random.

Block error-correcting codes, like Hamming codes, and Reed-Solomon codes transform a chunk of bits into a (longer) chunk of bits in such a way that errors up to some threshold in each block can be detected and corrected.

See also:



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Bullying

...     Contents TyrantRedirected from Bullying Tyrant is a term for someone with absolute governmental power, from the Greek language turannos. In ...

 
 
 
This page was created in 31 ms