Title of article
Intersecting codes and partially identifying codes
Author/Authors
Cohen، نويسنده , , G. and Encheva، نويسنده , , S. and Litsyn، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
9
From page
211
To page
219
Abstract
Let τ be a code of length n. Then x is called a descendant of the coalition of codewords a, b, …, ei fxi ∈ {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.
sent constructions based on linear intersecting codes.
Keywords
partially identifying code , Copyright protection , Intersecting code
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453003
Link To Document