作者: Chin L. Chen , Mu Y. Hsiao
DOI:
关键词: Error location 、 Polynomial 、 Binary number 、 Algorithm 、 Discrete mathematics 、 Symbol rate 、 Reed–Solomon error correction 、 Mathematics 、 Symbol (programming) 、 Decoding methods 、 Code word
摘要: This specification covers a simplified and high speed decoding scheme for Reed-Solomon codes capable of correcting up to three symbol errors in code words made k data n-k check symbols where each consists m binary bits information. In such the error location polynomial σ (x) = x e + 1 e-1 . equals number coefficient σ(x) are related syndromes S i by equation S.sub.i+e σ.sub.1 S.sub.i+e-1 +. σ.sub.e-1 S.sub.i+1 0. The decoder first tests if 0 If ≠ 0, assumption is that single has occurred. quickly verifies this determining 2 σS 3 when /S not goes on determine double occurred then there triple it turns out