Intersecting codes and partially identifying codes

G. Cohen*, S. Encheva, S. Litsyn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1-9
Number of pages9
JournalElectronic Notes in Discrete Mathematics
StatePublished - 2000


  • Copyright protection
  • Intersecting code
  • Partially identifying code


Dive into the research topics of 'Intersecting codes and partially identifying codes'. Together they form a unique fingerprint.

Cite this