Title of article :
Intersecting codes and separating codes Original Research Article
Author/Authors :
Mathias Cohnen، نويسنده , , S Encheva، نويسنده , , S Litsyn، نويسنده , , H.G Schaathun، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
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
Keywords :
Copyright protection , Intersecting code , Separating code
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
