If /spl Gamma//sub p/ is a p-ary code of length n, and a and b are two codewords, then c is called a descendant of a and b if c/sub i//spl isin/{a/sub i/, b/sub i/} for i=1,...,n. We are interested in codes /spl Gamma//sub p/ with the property that for any two codewords a and b their only descendant codewords are a and b themselves. This way a coalition of two users who are given codewords a and b cannot frame a third user who is given the codeword c. Intersecting codes over primary field GF(p) with the above mentioned property are found.
展开▼
机译：如果/ spl Gamma // sub p /是长度为n的p进制代码，并且a和b是两个代码字，则如果c / sub i // spl isin / {a / sub i /，b / sub i /}表示i = 1，...，n。我们对代码/ spl Gamma // sub p /感兴趣，该属性的特性是，对于任何两个代码字a和b，它们唯一的后代代码字本身就是a和b。这样，两个被赋予了代码字a和b的用户的联盟就无法构架被赋予了代码字c的第三用户。找到具有上述属性的主字段GF（p）上的相交代码。
展开▼
