Error detection and correction

<h2 id="definitions">Definitions</h2>
Error detection is the detection of errors caused by noise or other impairments during transmission from the transmitter to the receiver.
Error correction is the detection of errors and reconstruction of the original, error-free data.

<h2 id="history">History</h2>
In classical antiquity, <a href="/facts/Copyist/KpkX1Gvu">copyists</a> of the <a href="/facts/Hebrew_Bible/y8yblF9f">Hebrew Bible</a> were paid for their work according to the number of stichs (lines of verse). As the prose books of the Bible were hardly ever written in stichs, the copyists, in order to estimate the amount of work, had to count the letters.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a> This also helped ensure accuracy in the transmission of the text with the production of subsequent copies.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a><a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> Between the 7th and 10th centuries CE a <a href="/facts/Masoretes/4sumyaDq">group of Jewish scribes</a> formalized and expanded this to create the <a href="/facts/Masoretic_Text/mSVXBf1a">Numerical Masorah</a> to ensure accurate reproduction of the sacred text. It included counts of the number of words in a line, section, book and groups of books, noting the middle stich of a book, word use statistics, and commentary.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a> Standards became such that a deviation in even a single letter in a Torah scroll was considered unacceptable.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> The effectiveness of their error correction method was verified by the accuracy of copying through the centuries demonstrated by discovery of the <a href="/facts/Dead_Sea_Scrolls/vlbHRrJm">Dead Sea Scrolls</a> in 1947–1956, dating from c. 150 BCE-75 CE.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>
The modern development of <a href="/facts/Error_correction_code/cLUTUJrA">error correction codes</a> is credited to <a href="/facts/Richard_Hamming/plAXy9p0">Richard Hamming</a> in 1947.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a> A description of <a href="/facts/Hamming%2527s_code/zsI8cTRC">Hamming's code</a> appeared in <a href="/facts/Claude_Shannon/EremsCws">Claude Shannon</a>'s A Mathematical Theory of Communication<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> and was quickly generalized by <a href="/facts/Marcel_J._E._Golay/8BJ8gj2T">Marcel J. E. Golay</a>.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a>

<h2 id="principles">Principles</h2>
All error-detection and correction schemes add some <a href="/facts/Redundancy_(information_theory)/HnbfBLE0">redundancy</a> (i.e., some extra data) to a message, which receivers can use to check consistency of the delivered message and to recover data that has been determined to be corrupted. Error detection and correction schemes can be either <a href="/facts/Systematic_code/DM3P6SDT">systematic</a> or non-systematic. In a systematic scheme, the transmitter sends the original (error-free) data and attaches a fixed number of check bits (or parity data), which are derived from the data bits by some encoding algorithm. If error detection is required, a receiver can simply apply the same algorithm to the received data bits and compare its output with the received check bits; if the values do not match, an error has occurred at some point during the transmission. If error correction is required, a receiver can apply the decoding algorithm to the received data bits and the received check bits to recover the original error-free data. In a system that uses a non-systematic code, the original message is transformed into an encoded message carrying the same information and that has at least as many bits as the original message.
Good error control performance requires the scheme to be selected based on the characteristics of the communication channel. Common <a href="/facts/Channel_model/MtlxEShV">channel models</a> include <a href="/facts/Memoryless/8EgzaWtS">memoryless</a> models where errors occur randomly and with a certain probability, and dynamic models where errors occur primarily in <a href="/facts/Burst_error/UXkhCd2D">bursts</a>. Consequently, error-detecting and -correcting codes can be generally distinguished between random-error-detecting/correcting and burst-error-detecting/correcting. Some codes can also be suitable for a mixture of random errors and burst errors.
If the channel characteristics cannot be determined, or are highly variable, an error-detection scheme may be combined with a system for retransmissions of erroneous data. This is known as <a href="/facts/Automatic_repeat_request/1bR2urmF">automatic repeat request</a> (ARQ), and is most notably used in the Internet. An alternate approach for error control is <a href="/facts/Hybrid_automatic_repeat_request/tlFUMWfQ">hybrid automatic repeat request</a> (HARQ), which is a combination of ARQ and error-correction coding.

<h2 id="types-of-error-correction">Types of error correction</h2>
There are three major types of error correction:<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a>

<h3>Automatic repeat request</h3>
<a href="/facts/Automatic_repeat_request/1bR2urmF">Automatic repeat request</a> (ARQ) is an error control method for data transmission that makes use of error-detection codes, acknowledgment and/or negative acknowledgment messages, and <a href="/facts/Timeout_(computing)/va8CczEQ">timeouts</a> to achieve reliable data transmission. An acknowledgment is a message sent by the receiver to indicate that it has correctly received a <a href="/facts/Data_frame/ltGCbJIq">data frame</a>.
Usually, when the transmitter does not receive the acknowledgment before the timeout occurs (i.e., within a reasonable amount of time after sending the data frame), it retransmits the frame until it is either correctly received or the error persists beyond a predetermined number of retransmissions.
Three types of ARQ protocols are <a href="/facts/Stop-and-wait_ARQ/GxeM9F1S">Stop-and-wait ARQ</a>, <a href="/facts/Go-Back-N_ARQ/GyblPqaN">Go-Back-N ARQ</a>, and <a href="/facts/Selective_Repeat_ARQ/cuMB31b5">Selective Repeat ARQ</a>.
ARQ is appropriate if the communication channel has varying or unknown <a href="/facts/Channel_capacity/55wJYsS6">capacity</a>, such as is the case on the Internet. However, ARQ requires the availability of a <a href="/facts/Backward_channel/57b4SEMg">back channel</a>, results in possibly increased <a href="/facts/Latency_(engineering)/6Bjhn30H">latency</a> due to retransmissions, and requires the maintenance of buffers and timers for retransmissions, which in the case of <a href="/facts/Network_congestion/9ohkRMso">network congestion</a> can put a strain on the server and overall network capacity.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>
For example, ARQ is used on shortwave radio data links in the form of <a href="/facts/ARQ-E/LJhDJrdj">ARQ-E</a>, or combined with multiplexing as <a href="/facts/ARQ-M/ssKMtKdY">ARQ-M</a>.

<h3>Forward error correction</h3>
<a href="/facts/Forward_error_correction/cLUTUJrA">Forward error correction</a> (FEC) is a process of adding <a href="/facts/Redundancy_(information_theory)/HnbfBLE0">redundant data</a> such as an <a href="/facts/Error-correcting_code/cLUTUJrA">error-correcting code</a> (ECC) to a message so that it can be recovered by a receiver even when a number of errors (up to the capability of the code being used) are introduced, either during the process of transmission or on storage. Since the receiver does not have to ask the sender for retransmission of the data, a <a href="/facts/Backchannel/NUAqfG7d">backchannel</a> is not required in forward error correction. Error-correcting codes are used in <a href="/facts/Physical_layer/WuATCrVw">lower-layer</a> communication such as <a href="/facts/Cellular_network/8zA0jQJ9">cellular network</a>, high-speed <a href="/facts/Fiber-optic_communication/dc6S0Hg5">fiber-optic communication</a> and <a href="/facts/Wi-Fi/u94quCsx">Wi-Fi</a>,<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a><a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> as well as for reliable storage in media such as <a href="/facts/Flash_memory/Cn8JsStx">flash memory</a>, <a href="/facts/Hard_disk/kekLSGSE">hard disk</a> and <a href="/facts/ECC_memory/eG38xJoR">RAM</a>.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a>
Error-correcting codes are usually distinguished between <a href="/facts/Convolutional_code/HMCDdEGx">convolutional codes</a> and <a href="/facts/Block_code/QVuqpGga">block codes</a>:

<ul><li>Convolutional codes are processed on a bit-by-bit basis. They are particularly suitable for implementation in hardware, and the <a href="/facts/Viterbi_decoder/7Vu7USwt">Viterbi decoder</a> allows <a href="/facts/Maximum_likelihood_decoding/A0x9Dpgq">optimal decoding</a>.</li>
<li>Block codes are processed on a <a href="/facts/Block_(telecommunications)/xdWPKSWp">block-by-block</a> basis. Early examples of block codes are <a href="/facts/Repetition_code/RFLsgBtw">repetition codes</a>, <a href="/facts/Hamming_code/zsI8cTRC">Hamming codes</a> and <a href="/facts/Multidimensional_parity-check_code/Uznalurz">multidimensional parity-check codes</a>. They were followed by a number of efficient codes, <a href="/facts/Reed%25E2%2580%2593Solomon_code/HPc3Qj6N">Reed–Solomon codes</a> being the most notable due to their current widespread use. <a href="/facts/Turbo_code/F3nmelu0">Turbo codes</a> and <a href="/facts/Low-density_parity-check_code/yPYHEKAP">low-density parity-check codes</a> (LDPC) are relatively new constructions that can provide almost optimal efficiency.</li></ul>
<a href="/facts/Shannon%2527s_theorem/vvr8u4Gg">Shannon's theorem</a> is an important theorem in forward error correction, and describes the maximum <a href="/facts/Information_rate/ppUNMmVd">information rate</a> at which reliable communication is possible over a channel that has a certain error probability or <a href="/facts/Signal-to-noise_ratio/qohClhyG">signal-to-noise ratio</a> (SNR). This strict upper limit is expressed in terms of the <a href="/facts/Channel_capacity/55wJYsS6">channel capacity</a>. More specifically, the theorem says that there exist codes such that with increasing encoding length the probability of error on a <a href="/facts/Channel_model/MtlxEShV">discrete memoryless channel</a> can be made arbitrarily small, provided that the <a href="/facts/Code_rate/xPrLLTwt">code rate</a> is smaller than the channel capacity. The code rate is defined as the fraction k/n of k source symbols and n encoded symbols.
The actual maximum code rate allowed depends on the error-correcting code used, and may be lower. This is because Shannon's proof was only of existential nature, and did not show how to construct codes that are both optimal and have <a href="/facts/Polynomial_time/77T62gmf">efficient</a> encoding and decoding algorithms.

<h3>Hybrid schemes</h3>
Main article: <a href="/facts/Hybrid_ARQ/tlFUMWfQ">Hybrid ARQ</a>
<a href="/facts/Hybrid_ARQ/tlFUMWfQ">Hybrid ARQ</a> is a combination of ARQ and forward error correction. There are two basic approaches:<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a>

<ul><li>Messages are always transmitted with FEC parity data (and error-detection redundancy). A receiver decodes a message using the parity information and requests retransmission using ARQ only if the parity data was not sufficient for successful decoding (identified through a failed integrity check).</li>
<li>Messages are transmitted without parity data (only with error-detection information). If a receiver detects an error, it requests FEC information from the transmitter using ARQ and uses it to reconstruct the original message.</li></ul>
The latter approach is particularly attractive on an <a href="/facts/Erasure_channel/qJnFRvl9">erasure channel</a> when using a <a href="/facts/Rateless_erasure_code/st95SSf8">rateless erasure code</a>.

<h2 id="types-of-error-detection">Types of error detection</h2>
Error detection is most commonly realized using a suitable <a href="/facts/Hash_function/rk6MlCt3">hash function</a> (or specifically, a <a href="/facts/Checksum/AqxQ0I8g">checksum</a>, <a href="/facts/Cyclic_redundancy_check/u2exo4sv">cyclic redundancy check</a> or other algorithm). A hash function adds a fixed-length tag to a message, which enables receivers to verify the delivered message by recomputing the tag and comparing it with the one provided.
There exists a vast variety of different hash function designs. However, some are of particularly widespread use because of either their simplicity or their suitability for detecting certain kinds of errors (e.g., the cyclic redundancy check's performance in detecting <a href="/facts/Burst_error/UXkhCd2D">burst errors</a>).

<h3>Minimum distance coding</h3>
A random-error-correcting code based on <a href="/facts/Minimum_distance_coding/A0x9Dpgq">minimum distance coding</a> can provide a strict guarantee on the number of detectable errors, but it may not protect against a <a href="/facts/Preimage_attack/dDktzjys">preimage attack</a>.

<h3>Repetition codes</h3>
A <a href="/facts/Repetition_code/RFLsgBtw">repetition code</a> is a coding scheme that repeats the bits across a channel to achieve error-free communication. Given a stream of data to be transmitted, the data are divided into blocks of bits. Each block is transmitted some predetermined number of times. For example, to send the bit pattern 1011, the four-bit block can be repeated three times, thus producing 1011 1011 1011. If this twelve-bit pattern was received as 1010 1011 1011 – where the first block is unlike the other two – an error has occurred.
A repetition code is very inefficient and can be susceptible to problems if the error occurs in exactly the same place for each group (e.g., 1010 1010 1010 in the previous example would be detected as correct). The advantage of repetition codes is that they are extremely simple, and are in fact used in some transmissions of <a href="/facts/Numbers_station/fT8rCkvl">numbers stations</a>.<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a><a class="footnote-ref" id="fnref:17" href="#fn:17">17</a>

<h3>Parity bit</h3>
Main article: <a href="/facts/Parity_bit/peFp3Wau">Parity bit</a>
A parity bit is a bit that is added to a group of source bits to ensure that the number of set bits (i.e., bits with value 1) in the outcome is even or odd. It is a very simple scheme that can be used to detect single or any other odd number (i.e., three, five, etc.) of errors in the output. An even number of flipped bits will make the parity bit appear correct even though the data is erroneous.
Parity bits added to each word sent are called <a href="/facts/Transverse_redundancy_check/n4otoJpa">transverse redundancy checks</a>, while those added at the end of a stream of words are called <a href="/facts/Longitudinal_redundancy_check/vGoJjpjR">longitudinal redundancy checks</a>. For example, if each of a series of m-bit words has a parity bit added, showing whether there were an odd or even number of ones in that word, any word with a single error in it will be detected. It will not be known where in the word the error is, however. If, in addition, after each stream of n words a parity sum is sent, each bit of which shows whether there were an odd or even number of ones at that bit-position sent in the most recent group, the exact position of the error can be determined and the error corrected. This method is only guaranteed to be effective, however, if there are no more than 1 error in every group of n words. With more error correction bits, more errors can be detected and in some cases corrected.
There are also other bit-grouping techniques.

<h3>Checksum</h3>
Main article: <a href="/facts/Checksum/AqxQ0I8g">Checksum</a>
A checksum of a message is a <a href="/facts/Modular_arithmetic/0wtRa5dU">modular arithmetic</a> sum of message code words of a fixed word length (e.g., byte values). The sum may be negated by means of a <a href="/facts/Ones%2527-complement/Wl2PcLtg">ones'-complement</a> operation prior to transmission to detect unintentional all-zero messages.
Checksum schemes include parity bits, <a href="/facts/Check_digit/qMlumJpU">check digits</a>, and <a href="/facts/Longitudinal_redundancy_check/vGoJjpjR">longitudinal redundancy checks</a>. Some checksum schemes, such as the <a href="/facts/Damm_algorithm/h6YESDL5">Damm algorithm</a>, the <a href="/facts/Luhn_algorithm/s44Qds5L">Luhn algorithm</a>, and the <a href="/facts/Verhoeff_algorithm/AHq7WhQw">Verhoeff algorithm</a>, are specifically designed to detect errors commonly introduced by humans in writing down or remembering identification numbers.

<h3>Cyclic redundancy check</h3>
Main article: <a href="/facts/Cyclic_redundancy_check/u2exo4sv">Cyclic redundancy check</a>
A cyclic redundancy check (CRC) is a non-secure <a href="/facts/Hash_function/rk6MlCt3">hash function</a> designed to detect accidental changes to digital data in computer networks. It is not suitable for detecting maliciously introduced errors. It is characterized by specification of a generator polynomial, which is used as the <a href="/facts/Divisor/DKNa2GvC">divisor</a> in a <a href="/facts/Polynomial_long_division/MgJlJ2G7">polynomial long division</a> over a <a href="/facts/Finite_field/UkMGJo3m">finite field</a>, taking the input data as the <a href="/facts/Dividend/Na89kYjp">dividend</a>. The <a href="/facts/Remainder/wCmbYeeh">remainder</a> becomes the result.
A CRC has properties that make it well suited for detecting <a href="/facts/Burst_error/UXkhCd2D">burst errors</a>. CRCs are particularly easy to implement in hardware and are therefore commonly used in <a href="/facts/Computer_network/3w5RM99p">computer networks</a> and storage devices such as <a href="/facts/Hard_disk_drives/kekLSGSE">hard disk drives</a>.
The parity bit can be seen as a special-case 1-bit CRC.

<h3>Cryptographic hash function</h3>
Main article: <a href="/facts/Cryptographic_hash_function/cuxkgbST">Cryptographic hash function</a>
The output of a cryptographic hash function, also known as a message digest, can provide strong assurances about <a href="/facts/Data_integrity/g3XGbKIH">data integrity</a>, whether changes of the data are accidental (e.g., due to transmission errors) or maliciously introduced. Any modification to the data will likely be detected through a mismatching hash value. Furthermore, given some hash value, it is typically infeasible to find some input data (other than the one given) that will yield the same hash value. If an attacker can change not only the message but also the hash value, then a keyed hash or <a href="/facts/Message_authentication_code/mXxCP5Yl">message authentication code</a> (MAC) can be used for additional security. Without knowing the key, it is not possible for the attacker to easily or conveniently calculate the correct keyed hash value for a modified message.

<h3>Digital signature</h3>
Main article: <a href="/facts/Digital_signature/tY7e2pnW">Digital signature</a>
Digital signatures can provide strong assurances about data integrity, whether the changes of the data are accidental or maliciously introduced.
Digital signatures are perhaps most notable for being part of the HTTPS protocol for securely browsing the web.

<h3>Error correction code</h3>
Main article: <a href="/facts/Error_correction_code/cLUTUJrA">Error correction code</a>
Any error-correcting code can be used for error detection. A code with minimum <a href="/facts/Hamming_distance/MgdtbYPo">Hamming distance</a>, d, can detect up to d − 1 errors in a code word. Using minimum-distance-based error-correcting codes for error detection can be suitable if a strict limit on the minimum number of errors to be detected is desired.
Codes with minimum Hamming distance d = 2 are degenerate cases of error-correcting codes and can be used to detect single errors. The parity bit is an example of a single-error-detecting code.

<h2 id="applications">Applications</h2>
Applications that require low latency (such as telephone conversations) cannot use <a href="/facts/Automatic_repeat_request/1bR2urmF">automatic repeat request</a> (ARQ); they must use <a href="/facts/Forward_error_correction/cLUTUJrA">forward error correction</a> (FEC). By the time an ARQ system discovers an error and re-transmits it, the re-sent data will arrive too late to be usable.
Applications where the transmitter immediately forgets the information as soon as it is sent (such as most television cameras) cannot use ARQ; they must use FEC because when an error occurs, the original data is no longer available.
Applications that use ARQ must have a <a href="/facts/Return_channel/cXpe0qVl">return channel</a>; applications having no return channel cannot use ARQ. Applications that require extremely low error rates (such as digital money transfers) must use ARQ due to the possibility of uncorrectable errors with FEC.
Reliability and inspection engineering also make use of the theory of error-correcting codes<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>, as well as natural language<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a>.

<h3>Internet</h3>
In a typical <a href="/facts/TCP%2fIP/KNkxtSpw">TCP/IP</a> stack, error control is performed at multiple levels:

<ul><li>Each <a href="/facts/Ethernet_frame/LC4BXFhI">Ethernet frame</a> uses <a href="/facts/Cyclic_redundancy_check/u2exo4sv">CRC-32</a> error detection. Frames with detected errors are discarded by the receiver hardware.</li>
<li>The <a href="/facts/IPv4/bnQ5MEqm">IPv4</a> header contains a <a href="/facts/IPv4_header_checksum/a5gyM6nF">checksum</a> protecting the contents of the header. <a href="/facts/Network_packet/xCYf8SJu">Packets</a> with incorrect checksums are dropped within the network or at the receiver.</li>
<li>The checksum was omitted from the <a href="/facts/IPv6/d4dg7kIL">IPv6</a> header in order to minimize processing costs in <a href="/facts/Network_routing/Ml6MVCaC">network routing</a> and because current <a href="/facts/Link_layer/pHRpQ3k7">link layer</a> technology is assumed to provide sufficient error detection (see also RFC 3819).</li>
<li><a href="/facts/User_Datagram_Protocol/dxLU0D6q">UDP</a> has an optional checksum covering the payload and addressing information in the UDP and IP headers. Packets with incorrect checksums are discarded by the <a href="/facts/Network_stack/Btj9FtwJ">network stack</a>. The checksum is optional under IPv4, and required under IPv6. When omitted, it is assumed the data-link layer provides the desired level of error protection.</li>
<li><a href="/facts/Transmission_Control_Protocol/WW4sPrt9">TCP</a> provides a checksum for protecting the payload and addressing information in the TCP and IP headers. Packets with incorrect checksums are discarded by the network stack and eventually get retransmitted using ARQ, either explicitly (such as through <a href="/facts/Three-way_handshake/WW4sPrt9">three-way handshake</a>) or implicitly due to a <a href="/facts/Timeout_(computing)/va8CczEQ">timeout</a>.</li></ul>
<h3>Deep-space telecommunications</h3>
The development of error-correction codes was tightly coupled with the history of deep-space missions due to the extreme dilution of signal power over interplanetary distances, and the limited power availability aboard space probes. Whereas early missions sent their data uncoded, starting in 1968, digital error correction was implemented in the form of (sub-optimally decoded) <a href="/facts/Convolutional_code/HMCDdEGx">convolutional codes</a> and <a href="/facts/Reed%25E2%2580%2593Muller_code/HUKw1xrV">Reed–Muller codes</a>.<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> The Reed–Muller code was well suited to the noise the spacecraft was subject to (approximately matching a <a href="/facts/Gaussian_function/5bG8Kpp9">bell curve</a>), and was implemented for the Mariner spacecraft and used on missions between 1969 and 1977.
The <a href="/facts/Voyager_1/39jCxR9I">Voyager 1</a> and <a href="/facts/Voyager_2/9FAEaHUr">Voyager 2</a> missions, which started in 1977, were designed to deliver color imaging and scientific information from <a href="/facts/Jupiter/95m7XjMT">Jupiter</a> and <a href="/facts/Saturn/D54LcGJ9">Saturn</a>.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> This resulted in increased coding requirements, and thus, the spacecraft were supported by (optimally <a href="/facts/Viterbi_decoder/7Vu7USwt">Viterbi-decoded</a>) convolutional codes that could be <a href="/facts/Concatenated_code/kMtLmN80">concatenated</a> with an outer <a href="/facts/Binary_Golay_code/UY04RQEC">Golay (24,12,8) code</a>. The Voyager 2 craft additionally supported an implementation of a <a href="/facts/Reed%25E2%2580%2593Solomon_code/HPc3Qj6N">Reed–Solomon code</a>. The concatenated Reed–Solomon–Viterbi (RSV) code allowed for very powerful error correction, and enabled the spacecraft's extended journey to <a href="/facts/Uranus/x7YwT1ar">Uranus</a> and <a href="/facts/Neptune/1eucwHIC">Neptune</a>. After ECC system upgrades in 1989, both crafts used V2 RSV coding.
The <a href="/facts/Consultative_Committee_for_Space_Data_Systems/4IWDUAvL">Consultative Committee for Space Data Systems</a> currently recommends usage of error correction codes with performance similar to the Voyager 2 RSV code as a minimum. Concatenated codes are increasingly falling out of favor with space missions, and are replaced by more powerful codes such as <a href="/facts/Turbo_code/F3nmelu0">Turbo codes</a> or <a href="/facts/LDPC_code/yPYHEKAP">LDPC codes</a>.
The different kinds of deep space and orbital missions that are conducted suggest that trying to find a one-size-fits-all error correction system will be an ongoing problem. For missions close to Earth, the nature of the <a href="/facts/Noise_(electronics)/Izbv38Rr">noise</a> in the <a href="/facts/Communication_channel/MtlxEShV">communication channel</a> is different from that which a spacecraft on an interplanetary mission experiences. Additionally, as a spacecraft increases its distance from Earth, the problem of correcting for noise becomes more difficult.

<h3>Satellite broadcasting</h3>
The demand for satellite <a href="/facts/Transponder/cmqcWPwE">transponder</a> bandwidth continues to grow, fueled by the desire to deliver television (including new channels and <a href="/facts/High-definition_television/AuE6FRFI">high-definition television</a>) and IP data. Transponder availability and bandwidth constraints have limited this growth. Transponder capacity is determined by the selected <a href="/facts/Modulation/aAXPjINv">modulation</a> scheme and the proportion of capacity consumed by FEC.

<h3>Data storage</h3>
Error detection and correction codes are often used to improve the reliability of data storage media.<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> A parity track capable of detecting single-bit errors was present on the first <a href="/facts/Magnetic_tape_data_storage/qJUpJnk9">magnetic tape data storage</a> in 1951. The <a href="/facts/Optimal_rectangular_code/vGoJjpjR">optimal rectangular code</a> used in <a href="/facts/Group_coded_recording/rz5tW8Jq">group coded recording</a> tapes not only detects but also corrects single-bit errors. Some <a href="/facts/File_format/qrXbwJaH">file formats</a>, particularly <a href="/facts/Archive_formats/u7BIXv7D">archive formats</a>, include a checksum (most often <a href="/facts/CRC32/u2exo4sv">CRC32</a>) to detect corruption and truncation and can employ redundancy or <a href="/facts/Parity_file/lu1KwdTh">parity files</a> to recover portions of corrupted data. <a href="/facts/Cross-interleaved_Reed%25E2%2580%2593Solomon_coding/zJopfY8X">Reed-Solomon codes</a> are used in <a href="/facts/Compact_disc/g51GRloc">compact discs</a> to correct errors caused by scratches.
Modern hard drives use Reed–Solomon codes to detect and correct minor errors in sector reads, and to recover corrupted data from failing sectors and store that data in the spare sectors.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a> <a href="/facts/RAID/IpzWWgog">RAID</a> systems use a variety of error correction techniques to recover data when a hard drive completely fails. Filesystems such as <a href="/facts/ZFS/cmh5BHlp">ZFS</a> or <a href="/facts/Btrfs/lPwmXVJ6">Btrfs</a>, as well as some <a href="/facts/RAID/IpzWWgog">RAID</a> implementations, support <a href="/facts/Data_scrubbing/oDTdXAJp">data scrubbing</a> and resilvering, which allows bad blocks to be detected and (hopefully) recovered before they are used.<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a> The recovered data may be re-written to exactly the same physical location, to spare blocks elsewhere on the same piece of hardware, or the data may be rewritten onto replacement hardware.

<h3>Error-correcting memory</h3>
Main article: <a href="/facts/ECC_memory/eG38xJoR">ECC memory</a>
<a href="/facts/Dynamic_random-access_memory/koI9FGo5">Dynamic random-access memory</a> (DRAM) may provide stronger protection against <a href="/facts/Soft_error/E77QBbqI">soft errors</a> by relying on error-correcting codes. Such error-correcting memory, known as ECC or EDAC-protected memory, is particularly desirable for mission-critical applications, such as scientific computing, financial, medical, etc. as well as extraterrestrial applications due to the increased <a href="/facts/Cosmic_ray/uxCVdTKd">radiation</a> in space.
Error-correcting memory controllers traditionally use <a href="/facts/Hamming_code/zsI8cTRC">Hamming codes</a>, although some use <a href="/facts/Triple_modular_redundancy/QzscWD2F">triple modular redundancy</a>. <a href="/facts/Error_correction_code/cLUTUJrA">Interleaving</a> allows distributing the effect of a single cosmic ray potentially upsetting multiple physically neighboring bits across multiple words by associating neighboring bits to different words. As long as a <a href="/facts/Single-event_upset/LoGHTSFw">single-event upset</a> (SEU) does not exceed the error threshold (e.g., a single error) in any particular word between accesses, it can be corrected (e.g., by a single-bit error-correcting code), and the illusion of an error-free memory system may be maintained.<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a>
In addition to hardware providing features required for ECC memory to operate, <a href="/facts/Operating_system/8XTuvMh2">operating systems</a> usually contain related reporting facilities that are used to provide notifications when soft errors are transparently recovered. One example is the <a href="/facts/Linux_kernel/dlkduHuA">Linux kernel</a>'s EDAC subsystem (previously known as Bluesmoke), which collects the data from error-checking-enabled components inside a computer system; besides collecting and reporting back the events related to ECC memory, it also supports other checksumming errors, including those detected on the <a href="/facts/PCI_bus/n6CGuFvP">PCI bus</a>.<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a><a class="footnote-ref" id="fnref:27" href="#fn:27">27</a><a class="footnote-ref" id="fnref:28" href="#fn:28">28</a> A few systems[specify] also support <a href="/facts/Memory_scrubbing/WtskvNpM">memory scrubbing</a> to catch and correct errors early before they become unrecoverable.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Berger_code/AcQHmD0x">Berger code</a></li>
<li><a href="/facts/Burst_error-correcting_code/u44XaYBz">Burst error-correcting code</a></li>
<li><a href="/facts/ECC_memory/eG38xJoR">ECC memory</a>, a type of computer data storage</li>
<li><a href="/facts/Link_adaptation/vegwIxN8">Link adaptation</a></li>
<li><a href="/facts/List_of_algorithms/g3uenNkc">List of algorithms § Error detection and correction</a></li>
<li><a href="/facts/List_of_hash_functions/fdTqDa9l">List of hash functions</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li>Shu Lin; Daniel J. Costello, Jr. (1983). Error Control Coding: Fundamentals and Applications. <a href="/facts/Prentice_Hall/bynWAuat">Prentice Hall</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-13-283796-X.</li>
<li><a href="http://pdos.csail.mit.edu/papers/softecc:ddopson-meng/softecc_ddopson-meng.pdf">SoftECC: A System for Software Memory Integrity Checking</a></li>
<li><a href="http://www.fiala.me/pubs/papers/libsdc11.pdf">A Tunable, Software-based DRAM Error Detection and Correction Library for HPC</a> <a href="https://web.archive.org/web/20141107074502/http://www.fiala.me/pubs/papers/libsdc11.pdf">Archived</a> 2014-11-07 at the <a href="/facts/Wayback_Machine/nmQ3a6JC">Wayback Machine</a></li>
<li><a href="http://www.fiala.me/pubs/papers/sc12-redmpi.pdf">Detection and Correction of Silent Data Corruption for Large-Scale High-Performance Computing</a> <a href="https://web.archive.org/web/20141107074511/http://www.fiala.me/pubs/papers/sc12-redmpi.pdf">Archived</a> 2014-11-07 at the <a href="/facts/Wayback_Machine/nmQ3a6JC">Wayback Machine</a></li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="http://www.inference.phy.cam.ac.uk/mackay/itila/">The on-line textbook: Information Theory, Inference, and Learning Algorithms</a>, by <a href="/facts/David_J.C._MacKay/NK3D8JME">David J.C. MacKay</a>, contains chapters on elementary error-correcting codes; on the theoretical limits of error-correction; and on the latest state-of-the-art error-correcting codes, including <a href="/facts/Low-density_parity-check_code/yPYHEKAP">low-density parity-check codes</a>, <a href="/facts/Turbo_code/F3nmelu0">turbo codes</a>, and <a href="/facts/Fountain_codes/st95SSf8">fountain codes</a>.</li>
<li><a href="http://www.eccpage.com/">ECC Page</a> – implementations of popular ECC encoding and decoding routines</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">"Masorah". Jewish Encyclopedia. <a href="http://www.jewishencyclopedia.com/articles/10465-masorah" target="_blank">http://www.jewishencyclopedia.com/articles/10465-masorah</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Pratico, Gary D.; Pelt, Miles V. Van (2009). Basics of Biblical Hebrew Grammar: Second Edition. Zondervan. ISBN 978-0-310-55882-8. <a href="978-0-310-55882-8" target="_blank">978-0-310-55882-8</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Mounce, William D. (2007). Greek for the Rest of Us: Using Greek Tools Without Mastering Biblical Languages. Zondervan. p. 289. ISBN 978-0-310-28289-1. <a href="978-0-310-28289-1" target="_blank">978-0-310-28289-1</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">"Masorah". Jewish Encyclopedia. <a href="http://www.jewishencyclopedia.com/articles/10465-masorah" target="_blank">http://www.jewishencyclopedia.com/articles/10465-masorah</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Mishneh Torah, Tefillin, Mezuzah, and Sefer Torah, 1:2. Example English translation: Eliyahu Touger. The Rambam's Mishneh Torah. Moznaim Publishing Corporation. <a href="/wiki/Mishneh_Torah" target="_blank">/wiki/Mishneh_Torah</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Brian M. Fagan (5 December 1996). "Dead Sea Scrolls". The Oxford Companion to Archaeology. Oxford University Press. ISBN 0195076184. <a href="0195076184" target="_blank">0195076184</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Thompson, Thomas M. (1983), From Error-Correcting Codes through Sphere Packings to Simple Groups, The Carus Mathematical Monographs (#21), The Mathematical Association of America, p. vii, ISBN 0-88385-023-0 <a href="0-88385-023-0" target="_blank">0-88385-023-0</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Shannon, C.E. (1948), "A Mathematical Theory of Communication", Bell System Technical Journal, 27 (3): 379–423, doi:10.1002/j.1538-7305.1948.tb01338.x, hdl:10338.dmlcz/101429, PMID 9230594 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Golay, Marcel J. E. (1949), "Notes on Digital Coding", Proc.I.R.E. (I.E.E.E.), 37: 657 <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Gupta, Vikas; Verma, Chanderkant (November 2012). "Error Detection and Correction: An Introduction". International Journal of Advanced Research in Computer Science and Software Engineering. 2 (11). S2CID 17499858. <a href="/wiki/S2CID_(identifier)" target="_blank">/wiki/S2CID_(identifier)</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">A. J. McAuley, Reliable Broadband Communication Using a Burst Erasure Correcting Code, ACM SIGCOMM, 1990. <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Shah, Pradeep M.; Vyavahare, Prakash D.; Jain, Anjana (September 2015). "Modern error correcting codes for 4G and beyond: Turbo codes and LDPC codes". 2015 Radio and Antenna Days of the Indian Ocean (RADIO). pp. 1–2. doi:10.1109/RADIO.2015.7323369. ISBN 978-9-9903-7339-4. S2CID 28885076. Retrieved 22 May 2022. <a href="978-9-9903-7339-4" target="_blank">978-9-9903-7339-4</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">"IEEE SA - IEEE 802.11ac-2013". IEEE Standards Association. Archived from the original on 2022-05-22. Retrieved 2022-05-22. <a href="https://web.archive.org/web/20220522205452/https://standards.ieee.org/ieee/802.11ac/4473/" target="_blank">https://web.archive.org/web/20220522205452/https://standards.ieee.org/ieee/802.11ac/4473/</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">"Transition to Advanced Format 4K Sector Hard Drives | Seagate US". Seagate.com. Retrieved 22 May 2022. <a href="https://www.seagate.com/sg/en/tech-insights/advanced-format-4k-sector-hard-drives-master-ti/" target="_blank">https://www.seagate.com/sg/en/tech-insights/advanced-format-4k-sector-hard-drives-master-ti/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">A. J. McAuley, Reliable Broadband Communication Using a Burst Erasure Correcting Code, ACM SIGCOMM, 1990. <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Frank van Gerwen. "Numbers (and other mysterious) stations". Archived from the original on 12 July 2017. Retrieved 12 March 2012. <a href="https://web.archive.org/web/20170712053335/http://www.cisquet.nl/numbers.htm" target="_blank">https://web.archive.org/web/20170712053335/http://www.cisquet.nl/numbers.htm</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Gary Cutlack (25 August 2010). "Mysterious Russian 'Numbers Station' Changes Broadcast After 20 Years". Gizmodo. Archived from the original on 5 July 2017. Retrieved 12 March 2012. <a href="https://web.archive.org/web/20170705131816/https://www.gizmodo.com.au/2010/08/mysterious-russian-numbers-station-changes-broadcast-after-20-years/" target="_blank">https://web.archive.org/web/20170705131816/https://www.gizmodo.com.au/2010/08/mysterious-russian-numbers-station-changes-broadcast-after-20-years/</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Ben-Gal I.; Herer Y.; Raz T. (2003). "Self-correcting inspection procedure under inspection errors" (PDF). IIE Transactions. IIE Transactions on Quality and Reliability, 34(6), pp. 529-540. Archived from the original (PDF) on 2013-10-13. Retrieved 2014-01-10. <a href="https://web.archive.org/web/20131013171945/http://www.eng.tau.ac.il/~bengal/SCI_paper.pdf" target="_blank">https://web.archive.org/web/20131013171945/http://www.eng.tau.ac.il/~bengal/SCI_paper.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Yvo Meeres, Tommi A. Pirinen (2021). "Vowel Harmony Viewed as Error-Correcting Code". Proceedings of the Society for Computation in Linguistics. 4 (1): 313–322. doi:10.7275/bjvb-2n37. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">K. Andrews et al., The Development of Turbo and LDPC Codes for Deep-Space Applications, Proceedings of the IEEE, Vol. 95, No. 11, Nov. 2007. <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Huffman, William Cary; Pless, Vera S. (2003). Fundamentals of Error-Correcting Codes. Cambridge University Press. ISBN 978-0-521-78280-7. <a href="978-0-521-78280-7" target="_blank">978-0-521-78280-7</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Kurtas, Erozan M.; Vasic, Bane (2018-10-03). Advanced Error Control Techniques for Data Storage Systems. CRC Press. ISBN 978-1-4200-3649-7.[permanent dead link] <a href="978-1-4200-3649-7" target="_blank">978-1-4200-3649-7</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Scott A. Moulton. "My Hard Drive Died". Archived from the original on 2008-02-02. <a href="https://web.archive.org/web/20080202143103/http://www.myharddrivedied.com/presentations_whitepaper.html" target="_blank">https://web.archive.org/web/20080202143103/http://www.myharddrivedied.com/presentations_whitepaper.html</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Qiao, Zhi; Fu, Song; Chen, Hsing-Bung; Settlemyer, Bradley (2019). "Building Reliable High-Performance Storage Systems: An Empirical and Analytical Study". 2019 IEEE International Conference on Cluster Computing (CLUSTER). pp. 1–10. doi:10.1109/CLUSTER.2019.8891006. ISBN 978-1-7281-4734-5. S2CID 207951690. <a href="978-1-7281-4734-5" target="_blank">978-1-7281-4734-5</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">"Using StrongArm SA-1110 in the On-Board Computer of Nanosatellite". Tsinghua Space Center, Tsinghua University, Beijing. Archived from the original on 2011-10-02. Retrieved 2009-02-16. <a href="https://web.archive.org/web/20111002152735/http://www.apmcsta.org/File/doc/Conferences/6th%20meeting/Chen%20Zhenyu.doc" target="_blank">https://web.archive.org/web/20111002152735/http://www.apmcsta.org/File/doc/Conferences/6th%20meeting/Chen%20Zhenyu.doc</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Jeff Layton. "Error Detection and Correction". Linux Magazine. Retrieved 2014-08-12. <a href="http://www.admin-magazine.com/Articles/Monitoring-Memory-Errors" target="_blank">http://www.admin-magazine.com/Articles/Monitoring-Memory-Errors</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">"EDAC Project". bluesmoke.sourceforge.net. Retrieved 2014-08-12. <a href="http://bluesmoke.sourceforge.net/" target="_blank">http://bluesmoke.sourceforge.net/</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">"Documentation/edac.txt". Linux kernel documentation. kernel.org. 2014-06-16. Archived from the original on 2009-09-05. Retrieved 2014-08-12. <a href="https://web.archive.org/web/20090905174616/http://www.kernel.org/doc/Documentation/edac.txt" target="_blank">https://web.archive.org/web/20090905174616/http://www.kernel.org/doc/Documentation/edac.txt</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
</ol>

Error detection and correction open-in-new

Error detection and correction