| http://www.w3.org/ns/prov#value | - The method of claim 7, comprising finding a code C (n,k,q,d) such that ???q??? is close to an optimum number q* of rows as possible, k=logq(M+m), wherein M is a total number of manufacturers, m is equal to a number of fully activated slots, and such that there exists an error correcting code for q, k, n, with a Hamming distance d that satisfies n???K(n???d)>0, wherein ???K??? represent evil manufa
|
