| 摘要 |
An encoding system encodes up to 64 kilobytes of data using a binary Bose-Chaudhuri-Hocquenghem (BCH) error detection code. The code has as a generator polynomial g(x): g(x)=(x20+x17+1)*(x+1)*(x20+x3+1)*(x20+x3+x2+X+1) which in octal representation is: g(x)=4400001*3*4000011*4000017 where * and + represent Galois Field multiplication and addition, respectively. The associated primitive polynomial is x20+x17+1. The encoder encodes the data using a code based on a polynomial f(x), which is g(x) multiplied by a factor, b(x)=x3+x+1, or: f(x)=(x3+x+1)*(x20+x17+1)*(x+1)*(x20+x3+1)*(x20+x3+x2+X+1) which in octal representation is: f(x)=13*4400001*3*4000011*4000017 The inclusion of the factor in the code enhances the code's burst detecting capabilities. The code is capable of detecting 7 random errors, and a single burst error of up to 64 bits or double burst errors of up to 24 bits each.
|
