IBM Journal of Research and Development · 1970 · 86 citations · 5 references
EngineeringComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsChannel CodingCoding TheoryError Control CodingError CorrectionError DetectionError-correcting CodesBinary CodesCode ConstructionsError CodesError Correction CodesHamming CodesHamming DistanceReed-solomon CodesReed-solomon Coding
A high-speed method is derived for single-symbol error correcting Reed-Solomon and Hamming type codes. A matrix description is used for implementation of the codes, in which single-error correction in the Galois field 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sup> corresponds to correcting a block of b bits in a binary field. The resulting codes correct not only single-bit errors but also single clusters of b-adjacent-bit errors.
5
R. G. Gallager, W. W. Peterson · Mathematics of Computation · 1962 · 2.1K citations
Redundant residue polynomial codes
D. C. Bossen, Stephen S. Yau · Information and Control · 1968 · 23 citations