| http://www.w3.org/ns/prov#value | - 9## where qs is the largest integer that is less than (n-s)/m, thereby placing H0 in I0, Hs in Is, . . . , Hm-1 in Im-1 and then Hm in I0, Hm+s in Is, etc.; ECC signal generating circuits wherein a v-symbol Reed-Solomon error correcting code is generated from each of the m data groups Is (x), said generating circuits using an ECC generator polynomial having as roots v consecutive powers of ??, fro
|
