| 摘要 |
A system 100 for protecting a codeword u against an error in at least one <7-ary symbol, where q is an rLambda of two, r>=1 (q=T). The code word u 300 includes information symbols 310 u[0], . . . , u[k-1], k>1, each information symbol representing an integer in the range {theta, 2w-1}, where w=n*r, n>=1. A processor 130 includes an integer processing unit 140 for, under control of a program, calculating a parity symbol 312 u[k] for protecting the information symbols, where the parity symbol includes -(alpha[0]<<u[0]+alpha[1]<<u[1]+ . . . +a[k-1]*u[k-1]) mod M, where the multiplication . and the addition + are integer operations. The constants alpha[0], . . . , alpha[£-1] lie in {0, . . . , M-1}, M>=1 and are chosen such that the elements a[i]*d*qJ modM are unique for ie {0, . . . , k-1}, j e {0, . . . , n-1}, -q<d<q, d<>0.
|
