SettingsError detection and correction
Alternant code
In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes.
In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes.
AN codes
AN codes are error-correcting code that are used in arithmetic applications.
AN codes are error-correcting code that are used in arithmetic applications.
Automatic repeat request
Automatic Repeat reQuest (ARQ), also known as Automatic Repeat Query, is an error-control method for data transmission that uses acknowledgements (messages sent by the receiver indic...
Automatic Repeat reQuest (ARQ), also known as Automatic Repeat Query, is an error-control method for data transmission that uses acknowledgements (messages sent by the receiver indic...
Balanced code
In coding theory, a balanced code is a binary forward error correction code for which each codeword contains an equal number of zero and one bits.
In coding theory, a balanced code is a binary forward error correction code for which each codeword contains an equal number of zero and one bits.
BCH code
In coding theory the BCH codes form a class of parameterised error-correcting codes which have been the subject of much academic attention in the last fifty years.
In coding theory the BCH codes form a class of parameterised error-correcting codes which have been the subject of much academic attention in the last fifty years.
BCJR algorithm
The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes).
The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes).
Berger code
In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger.
In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger.
Berlekamp-Massey algorithm
The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence.
The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence.
Berlekamp-Welch algorithm
The Welch–Berlekamp algorithm, named after Elwyn R. Berlekamp and Lloyd R. Welch, provides another way to perform the decoding of Reed–Solomon codes.
The Welch–Berlekamp algorithm, named after Elwyn R. Berlekamp and Lloyd R. Welch, provides another way to perform the decoding of Reed–Solomon codes.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence.
The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence.
Berlekamp–Welch algorithm
The Welch–Berlekamp algorithm, named after Elwyn R. Berlekamp and L. R. Welch, provides another way to perform the decoding of Reed–Solomon codes.
The Welch–Berlekamp algorithm, named after Elwyn R. Berlekamp and L. R. Welch, provides another way to perform the decoding of Reed–Solomon codes.
Binary Golay code
In mathematics and electronics engineering, a binary Golay code is a type of error-correcting code used in digital communications.
In mathematics and electronics engineering, a binary Golay code is a type of error-correcting code used in digital communications.
Bipolar violation
A bipolar violation, bipolarity violation, or BPV, is a violation of the bipolar encoding rules where two pulses of the same polarity occur without an intervening pulse of the opposi...
A bipolar violation, bipolarity violation, or BPV, is a violation of the bipolar encoding rules where two pulses of the same polarity occur without an intervening pulse of the opposi...
Casting out nines
Casting out nines is a sanity check to ensure that hand computations of sums, differences, products, and quotients of integers are correct.
Casting out nines is a sanity check to ensure that hand computations of sums, differences, products, and quotients of integers are correct.
Check digit
A check digit is a form of redundancy check used for error detection, the decimal equivalent of a binary checksum.
A check digit is a form of redundancy check used for error detection, the decimal equivalent of a binary checksum.
Chien search
In abstract algebra, the Chien search, named after R. T. Chien, is a fast algorithm for determining roots of polynomials defined over a finite field.
In abstract algebra, the Chien search, named after R. T. Chien, is a fast algorithm for determining roots of polynomials defined over a finite field.
Chipkill
Chipkill is IBM's trademark for a form of advanced error checking and correcting (ECC) computer memory technology that protects computer memory systems from any single memory chip failure as wel...
Chipkill is IBM's trademark for a form of advanced error checking and correcting (ECC) computer memory technology that protects computer memory systems from any single memory chip failure as wel...
Coding gain
In related engineering problems, coding gain is the measure in the difference in math and geometry signal to noise ratio (SNR) levels between the uncoded system and coded system required to reac...
In related engineering problems, coding gain is the measure in the difference in math and geometry signal to noise ratio (SNR) levels between the uncoded system and coded system required to reac...
Coding theory
Coding theory is the study of the properties of codes and their fitness for a specific application.
Coding theory is the study of the properties of codes and their fitness for a specific application.
Concatenated error correction code
In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code.
In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code.
Constant-weight code
In coding theory, a constant-weight code, also called an m of n code, is an error detection and correction code where all codewords share the same Hamming weight.
In coding theory, a constant-weight code, also called an m of n code, is an error detection and correction code where all codewords share the same Hamming weight.
Coset leader
In the field of coding theory, a coset leader is defined as a word of minimum weight in any particular coset - that is, a word with the lowest amount of non-zero entries.
In the field of coding theory, a coset leader is defined as a word of minimum weight in any particular coset - that is, a word with the lowest amount of non-zero entries.
Cross-interleaved Reed-Solomon coding
In the compact disc system, cross-interleaved Reed-Solomon code (or CIRC) provides error detection and error correction.
In the compact disc system, cross-interleaved Reed-Solomon code (or CIRC) provides error detection and error correction.
Data scrubbing
Data scrubbing is an error correction technique which uses a background task that periodically inspects memory for errors, and then corrects the error using ECC memory or another copy of the data.
Data scrubbing is an error correction technique which uses a background task that periodically inspects memory for errors, and then corrects the error using ECC memory or another copy of the data.
Detection Error Tradeoff
A Detection Error Tradeoff graph is a graphical plot of error rates for binary classification systems, plotting false reject rate vs. false accept rate.
A Detection Error Tradeoff graph is a graphical plot of error rates for binary classification systems, plotting false reject rate vs. false accept rate.
Detection error tradeoff
A detection error tradeoff graph is a graphical plot of error rates for binary classification systems, plotting false reject rate vs. false accept rate.
A detection error tradeoff graph is a graphical plot of error rates for binary classification systems, plotting false reject rate vs. false accept rate.
Echo (computing)
In computer telecommunications, echo is the display or return of sent data at or to the sending end of a transmission.
In computer telecommunications, echo is the display or return of sent data at or to the sending end of a transmission.
Enumerator polynomial
In mathematics, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight.
In mathematics, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight.
Error correction model
An error correction model is a dynamical system with the characteristics that the deviation of the current state from its long-run relationship will be fed into its short-run dynamics.
An error correction model is a dynamical system with the characteristics that the deviation of the current state from its long-run relationship will be fed into its short-run dynamics.
Error detection and correction
In information theory and coding theory with applications in computer science and telecommunication, error detection and correction or error control are techniques that enable reliable del...
In information theory and coding theory with applications in computer science and telecommunication, error detection and correction or error control are techniques that enable reliable del...
Error-correcting codes with feedback
In mathematics, computer science, telecommunication, information theory, and searching theory, error-correcting codes with feedback refers to error correcting codes designed to work in the prese...
In mathematics, computer science, telecommunication, information theory, and searching theory, error-correcting codes with feedback refers to error correcting codes designed to work in the prese...
EXIT chart
An Extrinsic information transfer chart, commonly called an EXIT chart, is a technique to aid the construction of good iteratively-decoded error-correcting codes (in particular low-density...
An Extrinsic information transfer chart, commonly called an EXIT chart, is a technique to aid the construction of good iteratively-decoded error-correcting codes (in particular low-density...
Expander code
In coding theory, expander codes are a type of linear block code that arises by using bipartite expander graphs.
In coding theory, expander codes are a type of linear block code that arises by using bipartite expander graphs.
Forney algorithm
The Forney algorithm (or Forney's algorithm) calculates the error values at known error locations.
The Forney algorithm (or Forney's algorithm) calculates the error values at known error locations.
Forward error correction
In telecommunication, information theory, and coding theory, forward error correction or channel coding is a technique used for controlling errors in data transmission over unreliable or n...
In telecommunication, information theory, and coding theory, forward error correction or channel coding is a technique used for controlling errors in data transmission over unreliable or n...
General minimum distance decoding
In coding theory, generalized minimum distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the oute...
In coding theory, generalized minimum distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the oute...
Generalized minimum distance decoding
In coding theory, generalized minimum distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the oute...
In coding theory, generalized minimum distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the oute...
Generalized minimum-distance decoding
In coding theory, generalized minimum-distance decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the outer code.
In coding theory, generalized minimum-distance decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the outer code.
Go-Back-N ARQ
Go-Back-N ARQ is a specific instance of the automatic repeat request (ARQ) protocol, in which the sending process continues to send a number of frames specified by a window size even without...
Go-Back-N ARQ is a specific instance of the automatic repeat request (ARQ) protocol, in which the sending process continues to send a number of frames specified by a window size even without...
Group code recording
In computer science, group code recording (GCR) refers to several distinct but related encoding methods for magnetic media.
In computer science, group code recording (GCR) refers to several distinct but related encoding methods for magnetic media.
Hadamard code
The Hadamard code is an error-correcting code that is used for error detection and correction when transmitting messages over very noisy or unreliable channels.
The Hadamard code is an error-correcting code that is used for error detection and correction when transmitting messages over very noisy or unreliable channels.
Hagelbarger code
In telecommunication, a Hagelbarger code is a convolutional code that enables error bursts to be corrected provided that there are relatively long error-free intervals between the error bursts.
In telecommunication, a Hagelbarger code is a convolutional code that enables error bursts to be corrected provided that there are relatively long error-free intervals between the error bursts.
Hamming code
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code invented by Richard Hamming in 1950.
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code invented by Richard Hamming in 1950.
Hamming(7,4)
Hamming is a Hamming code that encodes 4 bits of data into 7 bits by adding 3 parity bits.
Hamming is a Hamming code that encodes 4 bits of data into 7 bits by adding 3 parity bits.
Hardened Core
Hardened Core, or H-Core, is a patented is a technique for the detection and correction of radiation-induced single event upsets that propagate into the internal control circuits.
Hardened Core, or H-Core, is a patented is a technique for the detection and correction of radiation-induced single event upsets that propagate into the internal control circuits.
Hash function
A hash function is any algorithm or subroutine that maps large data sets of variable length, called keys, to smaller data sets of a fixed length.
A hash function is any algorithm or subroutine that maps large data sets of variable length, called keys, to smaller data sets of a fixed length.
Hash list
In computer science, a hash list is typically a list of hashes of the data blocks in a file or set of files.
In computer science, a hash list is typically a list of hashes of the data blocks in a file or set of files.
Hash tree
In cryptography and computer science Hash trees or Merkle trees are a type of data structure which contains a tree of summary information about a larger piece of data – for instance a file...
In cryptography and computer science Hash trees or Merkle trees are a type of data structure which contains a tree of summary information about a larger piece of data – for instance a file...
Header Check Sequence
Header Sequence Number is basically a CRC of the MAC header.
Header Sequence Number is basically a CRC of the MAC header.
Header checksum
Header Checksum refers to the basic protection used in the header of IP packets against data corruption.
Header Checksum refers to the basic protection used in the header of IP packets against data corruption.
Hybrid automatic repeat request
Hybrid automatic repeat request (hybrid ARQ or HARQ) is a combination of high-rate forward error-correcting coding and ARQ error-control.
Hybrid automatic repeat request (hybrid ARQ or HARQ) is a combination of high-rate forward error-correcting coding and ARQ error-control.
Interleaving
In computer science and telecommunication, interleaving is a way to arrange data in a non-contiguous way to increase performance.
In computer science and telecommunication, interleaving is a way to arrange data in a non-contiguous way to increase performance.
IPv4 header checksum
IPv4 header checksum refers to the basic protection used in the header of IPv4 packets against data corruption.
IPv4 header checksum refers to the basic protection used in the header of IPv4 packets against data corruption.
Iterative Viterbi decoding
Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e., probability ...
Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e., probability ...
Justesen code
In coding theory, Justesen codes form a class of Error detection and correction codes which are derived from Reed-Solomon code and have good error-control properties.
In coding theory, Justesen codes form a class of Error detection and correction codes which are derived from Reed-Solomon code and have good error-control properties.
Latin square
In combinatorics and in experimental design, a Latin square is an n × n array filled with n different symbols, each occurring exactly once in each row and e...
In combinatorics and in experimental design, a Latin square is an n × n array filled with n different symbols, each occurring exactly once in each row and e...
Lexicographic code
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties.
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties.
Link adaptation
Link adaptation, or adaptive coding and modulation (ACM), is a term used in wireless communications to denote the matching of the modulation, coding and other signal and protocol parameter...
Link adaptation, or adaptive coding and modulation (ACM), is a term used in wireless communications to denote the matching of the modulation, coding and other signal and protocol parameter...
List decoding
In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates.
In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates.
List-decoding
In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates.
In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates.
Locally decodable code
A locally decodable code is an error-correcting code that allows to decode a single bit of a message with high probability by only looking at a small number of bits of a possibly partially corru...
A locally decodable code is an error-correcting code that allows to decode a single bit of a message with high probability by only looking at a small number of bits of a possibly partially corru...
Locally testable code
In theoretical computer science, a locally testable code is an error correcting code for which membership can be tested by a non-adaptive property testing algorithm.
In theoretical computer science, a locally testable code is an error correcting code for which membership can be tested by a non-adaptive property testing algorithm.
Long code (mathematics)
In theoretical computer science and coding theory, the long code is a type of error-correcting code.
In theoretical computer science and coding theory, the long code is a type of error-correcting code.
Longitudinal redundancy check
In telecommunication, a longitudinal redundancy check or horizontal redundancy check is a form of redundancy check that is applied independently to each of a parallel group of bit streams.
In telecommunication, a longitudinal redundancy check or horizontal redundancy check is a form of redundancy check that is applied independently to each of a parallel group of bit streams.
Low-density parity-check code
In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel, and is construc...
In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel, and is construc...
Luhn algorithm
The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit ...
The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit ...
Majority logic decoding
In error detection and correction, majority logic decoding is a method to decode repetition codes, based on the assumption that the largest number of occurrences of a symbol was the transmitted ...
In error detection and correction, majority logic decoding is a method to decode repetition codes, based on the assumption that the largest number of occurrences of a symbol was the transmitted ...
Maximum likelihood sequence estimation
Maximum likelihood sequence estimation (MLSE) is a mathematical algorithm to extract useful data out of a noisy data stream.
Maximum likelihood sequence estimation (MLSE) is a mathematical algorithm to extract useful data out of a noisy data stream.
Memory ProteXion
Memory ProteXion, found in IBM xSeries servers, is a form of "redundant bit steering".
Memory ProteXion, found in IBM xSeries servers, is a form of "redundant bit steering".
Multi-channel memory architecture
Multi-channel architecture is a technology that increases the transfer speed of data between the RAM and the memory controller by adding more channels of communication between them.
Multi-channel architecture is a technology that increases the transfer speed of data between the RAM and the memory controller by adding more channels of communication between them.
Multidimensional parity-check code
A multidimensional parity-check code (MDPC) is a simple type of error correcting code that operates by arranging the message into a multidimensional grid, and calculating a parity digit for each...
A multidimensional parity-check code (MDPC) is a simple type of error correcting code that operates by arranging the message into a multidimensional grid, and calculating a parity digit for each...
NAK (protocol message)
The NAK (or NACK) protocol message is sent in many communications protocols to negatively acknowledge or reject a previously received message, or to indicate some kind of error.
The NAK (or NACK) protocol message is sent in many communications protocols to negatively acknowledge or reject a previously received message, or to indicate some kind of error.
Negative-acknowledge character
* In telecommunications, a negative-acknowledge character (NAK or NACK) is a transmission control character sent by a station as a negative response to the station with which the connection has ...
* In telecommunications, a negative-acknowledge character (NAK or NACK) is a transmission control character sent by a station as a negative response to the station with which the connection has ...
Parity bit
A parity bit is a bit that is added to ensure that the number of bits with the value one in a set of bits is even or odd.
A parity bit is a bit that is added to ensure that the number of bits with the value one in a set of bits is even or odd.
Parvaresh-Vardy code
Parvaresh–Vardy codes are a family of error-correcting codes first described in 2005 by Farzad Parvaresh and Alexander Vardy.
Parvaresh–Vardy codes are a family of error-correcting codes first described in 2005 by Farzad Parvaresh and Alexander Vardy.
Pearson hashing
Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
Preparata code
In coding theory, the Preparata codes form a class of non-linear double-error-correcting codes.
In coding theory, the Preparata codes form a class of non-linear double-error-correcting codes.
Pseudo bit error ratio
Pseudo bit error ratio, also known as "Hexagon", in adaptive high-frequency radio, is a bit error ratio derived by a majority decoder that processes redundant transmissions.
Pseudo bit error ratio, also known as "Hexagon", in adaptive high-frequency radio, is a bit error ratio derived by a majority decoder that processes redundant transmissions.
Rank error correcting code
In coding theory, Rank codes are non-binary linear error-correcting codes over not Hamming but rank metric.
In coding theory, Rank codes are non-binary linear error-correcting codes over not Hamming but rank metric.
Rank error-correcting code
In coding theory, rank codes are non-binary linear error-correcting codes over not Hamming but rank metric.
In coding theory, rank codes are non-binary linear error-correcting codes over not Hamming but rank metric.
Redundant array of independent memory
A redundant array of independent memory (RAIM) is a design feature found in certain computers' main random access memory.
A redundant array of independent memory (RAIM) is a design feature found in certain computers' main random access memory.
Reed-Muller code
Reed–Muller codes are a family of linear error-correcting codes used in communications.
Reed–Muller codes are a family of linear error-correcting codes used in communications.
Reed-Solomon error correction
In coding theory, Reed–Solomon (RS) codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon.
In coding theory, Reed–Solomon (RS) codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon.
Reed–Muller code
Reed–Muller codes are a family of linear error-correcting codes used in communications.
Reed–Muller codes are a family of linear error-correcting codes used in communications.
Reed–Solomon error correction
In coding theory, Reed–Solomon codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon.
In coding theory, Reed–Solomon codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon.
Remote Error Indication
Remote Error Indication (REI) or formerly Far End Block Error (FEBE) is an alarm signal used in synchronous optical networking (SONET).
Remote Error Indication (REI) or formerly Far End Block Error (FEBE) is an alarm signal used in synchronous optical networking (SONET).
Repeat-accumulate code
In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes.
In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes.
Repetition code
In coding theory, the repetition code is one of the most basic error-correcting codes.
In coding theory, the repetition code is one of the most basic error-correcting codes.
Residual bit error rate
The residual bit error rate (RBER) is a receive quality metric in digital transmission, one of several used to quantify the accuracy of the received data.
The residual bit error rate (RBER) is a receive quality metric in digital transmission, one of several used to quantify the accuracy of the received data.
Sanity testing
A sanity test or sanity check is a basic test to quickly evaluate whether a claim or the result of a calculation can possibly be true.
A sanity test or sanity check is a basic test to quickly evaluate whether a claim or the result of a calculation can possibly be true.
Selective Repeat ARQ
Selective Repeat ARQ / Selective Reject ARQ is a specific instance of the Automatic Repeat-Request (ARQ) Protocol.
Selective Repeat ARQ / Selective Reject ARQ is a specific instance of the Automatic Repeat-Request (ARQ) Protocol.
Sequential decoding
Sequential decoding is a limited memory technique for decoding tree codes.
Sequential decoding is a limited memory technique for decoding tree codes.
Shaping codes
In digital communications shaping codes are a method of encoding that changes the distribution of signals to improve efficiency.
In digital communications shaping codes are a method of encoding that changes the distribution of signals to improve efficiency.
Slepian-Wolf coding
Slepian–Wolf coding is a method of coding using two compressed correlated sources.
Slepian–Wolf coding is a method of coding using two compressed correlated sources.
Snake-in-the-box
The snake-in-the-box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube.
The snake-in-the-box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube.
Soft output Viterbi algorithm
The soft output Viterbi algorithm (SOVA) is a variant of the classical Viterbi algorithm.
The soft output Viterbi algorithm (SOVA) is a variant of the classical Viterbi algorithm.
Soft-decision decoder
In information theory, a soft-decision decoder is a class of algorithm used to decode data that has been encoded with an error correcting code.
In information theory, a soft-decision decoder is a class of algorithm used to decode data that has been encoded with an error correcting code.
Soft-in soft-out decoder
A soft-in soft-out (SISO) decoder is a type of soft-decision decoder used with error correcting codes.
A soft-in soft-out (SISO) decoder is a type of soft-decision decoder used with error correcting codes.
Sparse graph code
A Sparse graph code is a code which is represented by a sparse graph.
A Sparse graph code is a code which is represented by a sparse graph.
Srivastava code
In coding theory, Srivastava codes form a class of parameterised error-correcting codes which are a special case of alternant codes.
In coding theory, Srivastava codes form a class of parameterised error-correcting codes which are a special case of alternant codes.
Stop-and-wait ARQ
Stop-and-wait ARQ is a method used in telecommunications to send information between two connected devices.
Stop-and-wait ARQ is a method used in telecommunications to send information between two connected devices.
Time triple modular redundancy
Time triple modular redundancy, also known as TTMR, is a patented single event upset mitigation technique that detects and corrects errors in a computer or microprocessor.
Time triple modular redundancy, also known as TTMR, is a patented single event upset mitigation technique that detects and corrects errors in a computer or microprocessor.
Transverse redundancy check
In telecommunications, a transverse redundancy check (TRC) or vertical redundancy check is a redundancy check for synchronized parallel bit s applied once per bit time, across the bit streams.
In telecommunications, a transverse redundancy check (TRC) or vertical redundancy check is a redundancy check for synchronized parallel bit s applied once per bit time, across the bit streams.
Triple modular redundancy
In computing, triple modular redundancy is a fault-tolerant form of N-modular redundancy, in which three systems perform a process and that result is processed by a voting system to produce a si...
In computing, triple modular redundancy is a fault-tolerant form of N-modular redundancy, in which three systems perform a process and that result is processed by a voting system to produce a si...
Triple-channel architecture
Triple-channel architecture describes a technology that theoretically increases the data throughput to speeds greater than that of its predecessor, dual-channel architecture.
Triple-channel architecture describes a technology that theoretically increases the data throughput to speeds greater than that of its predecessor, dual-channel architecture.
Turbo code
In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed in 1993, which were the first practical c...
In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed in 1993, which were the first practical c...
Verhoeff algorithm
The Verhoeff algorithm, a checksum formula for error detection first published in 1969, was developed by Dutch mathematician Jacobus Verhoeff (born 1927).
The Verhoeff algorithm, a checksum formula for error detection first published in 1969, was developed by Dutch mathematician Jacobus Verhoeff (born 1927).
Viterbi algorithm
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observe...
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observe...
Viterbi decoder
A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using a convolutional code.
A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using a convolutional code.
Walsh code
In the field of mathematics, the Walsh-Hadamard code is an error correcting code over a binary alphabet that allows reconstruction of any codeword if less than half its bits are corrupted.
In the field of mathematics, the Walsh-Hadamard code is an error correcting code over a binary alphabet that allows reconstruction of any codeword if less than half its bits are corrupted.
Wonzencraft Ensemble
In that paper, Justesen used that set of linear codes, which is called Wonzencraft ensemble, as the inner codes in his construction of strongly explicit asymptotically good code.
In that paper, Justesen used that set of linear codes, which is called Wonzencraft ensemble, as the inner codes in his construction of strongly explicit asymptotically good code.
Wozencraft ensemble
In coding theory, the Wozencraft ensemble us a set of linear codes in which most of codes satisfy the Gilbert-Varshamov bound.
In coding theory, the Wozencraft ensemble us a set of linear codes in which most of codes satisfy the Gilbert-Varshamov bound.
Zemor's decoding algorithm
In coding theory, Zemor's algorithm, designed and developed by Gilles Zemor, is a recursive low-complexity approach to code construction.
In coding theory, Zemor's algorithm, designed and developed by Gilles Zemor, is a recursive low-complexity approach to code construction.
Zigzag code
Zigzag code is a simple linear error-correcting code.
Zigzag code is a simple linear error-correcting code.