b-adjacent error correction
暂无分享,去创建一个
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 Galoies field 2b 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.
[1] John Cocke,et al. Lossless symbol coding with nonprimes (Corresp.) , 1959, IRE Transactions on Information Theory.
[2] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[3] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[4] Stephen S. Yau,et al. Redundant Residue Polynomial Codes , 1968, Inf. Control..
[5] R. T. Chien,et al. Error detection and correction in a photo-digital storage system , 1968 .