Intersecting codes and separating codes

G. Cohnen, S. Encheva*, S. Litsyn, H. G. Schaathun

*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,⋯,e if xi∈{a i,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.

Original languageEnglish
Pages (from-to)75-83
Number of pages9
JournalDiscrete Applied Mathematics
Issue number1 SPEC.
StatePublished - 15 May 2003
Externally publishedYes


  • Copyright protection
  • Intersecting code
  • Separating code


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

Cite this