| http://www.w3.org/ns/prov#value | - multiplier, and q is the largest integer that is less than n/m; a CRC signal generator circuit wherein k CRC symbols Cj are generated according to the CRC function Cj =G(x) mod (x+αr+j+1)j=0, 1, 2, . . . , k-1 where ?? is a primitive element whose powers generate all the non-zero elements of the finite field GF(2p), where p is the number of binary digits in each symbol, and r is an arbitrary
|
