User:Sendoshin/Books/EDAC

Version 1

 * Introduction
 * Error detection and correction
 * Information theory
 * Coding theory
 * Automatic repeat request
 * Forward error correction
 * Hybrid automatic repeat request
 * Algorithm
 * Burst error


 * Error Detection Schemes
 * Repetition code
 * Parity bit
 * Longitudinal redundancy check
 * Transverse redundancy check
 * Non-standard RAID levels
 * Checksum
 * Check digit
 * Luhn algorithm
 * Verhoeff algorithm
 * Cyclic redundancy check
 * Cyclic code
 * Hash function
 * Polynomial code
 * Polynomial long division
 * Cryptographic hash function
 * Data integrity
 * Message authentication code
 * Hamming distance
 * Berger code
 * Delay insensitive circuit


 * Error Correction
 * Data transmission
 * Frame (networking)
 * Stop-and-wait ARQ
 * Go-Back-N ARQ
 * Selective Repeat ARQ
 * Back-channel
 * Latency (engineering)
 * Convolutional code
 * Viterbi decoder
 * Viterbi algorithm
 * Decoding methods
 * Block code
 * Multidimensional parity-check code
 * Reed–Solomon error correction
 * BCH code
 * Berlekamp–Massey algorithm
 * Turbo code
 * Low-density parity-check code
 * Noisy-channel coding theorem
 * Signal-to-noise ratio
 * Channel capacity
 * Probability of error
 * Code rate
 * Channel (communications)
 * Time complexity


 * Applications
 * Reed–Muller code
 * Binary Golay code
 * Consultative Committee for Space Data Systems
 * Noise (electronics)
 * Phase-shift keying
 * Quadrature amplitude modulation
 * Triple modular redundancy


 * See Also
 * Alternant code
 * Automated Quality control of meteorological observations
 * BCJR algorithm
 * Binary symmetric channel
 * Bipolar violation
 * Bit error rate
 * Casting out nines
 * Chien search
 * Chipkill
 * Coding gain
 * Computational complexity theory
 * Concatenated error correction code
 * Constant-weight code
 * Coset leader
 * Cross-interleaved Reed-Solomon coding
 * Data scrubbing
 * Detection Error Tradeoff
 * Enumerator polynomial
 * Error correction model
 * Error-correcting codes with feedback
 * EXIT chart
 * Finite field
 * Forward-backward algorithm
 * G.hn
 * Group code recording
 * Hadamard code
 * Hagelbarger code
 * Hamming(7,4)
 * Hamming code
 * Hamming weight
 * Hardened Core
 * Hash list
 * Hash tree
 * Header Check Sequence
 * Header checksum
 * Interleaving
 * Iterative Viterbi decoding
 * Justesen code
 * Latin square
 * Lexicographic code
 * Linear code
 * Link adaptation
 * List-decoding
 * Locally decodable code
 * Locally testable code
 * Long code (mathematics)
 * Majority logic decoding
 * Maximum likelihood sequence estimation
 * Memory ProteXion
 * NAK (protocol message)
 * Negative-acknowledge character
 * Pearson hashing
 * Preparata code
 * Pseudo bit error ratio
 * Redundant array of independent memory
 * Remote Error Indication
 * Repeat-accumulate code
 * Richard Hamming
 * Sanity testing
 * Sequential decoding
 * Shaping codes
 * Snake-in-the-box
 * Soft output Viterbi algorithm
 * Soft-decision decoder
 * Soft-in soft-out decoder
 * Sparse graph code
 * Srivastava code
 * Summation check
 * Systematic code
 * Time triple modular redundancy
 * Triple-channel architecture
 * Walsh code
 * Exclusive or
 * Zigzag code