Intersecting codes and separating codes
Let ? be a code of length n. Then x is called a descendant of the coalition of codewords a,b,,e if xi?{ai,bi,,ei} for i=1,,n. We study codes with the following property: any two non-intersecting coalitions of a limited size have no common descendant. We present constructions based on linear intersecting codes.
intersecting code separating code copyright protection