TY - JOUR
T1 - Intersecting codes and partially identifying codes
AU - Cohen, G.
AU - Encheva, S.
AU - Litsyn, S.
PY - 2000
Y1 - 2000
N2 - Let Γ be a code of length n. Then x is called a descendant of the coalition of codewords a, b,..., eifxi ∈ {ai, b i, ..., 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.
AB - Let Γ be a code of length n. Then x is called a descendant of the coalition of codewords a, b,..., eifxi ∈ {ai, b i, ..., 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.
KW - Copyright protection
KW - Intersecting code
KW - Partially identifying code
UR - http://www.scopus.com/inward/record.url?scp=52549112713&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:52549112713
SN - 1571-0653
VL - 6
SP - 1
EP - 9
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -