Separating Partition Systems and Locally Different Sequences

DOI10.1137/0401035zbMath0723.05039OpenAlexW1980191220MaRDI QIDQ3211322

János Körner, Gábor Simonyi

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401035

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)

Related Items (13)

Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ On the extremal combinatorics of the Hamming space ⋮ Unnamed Item ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Separation and Witnesses ⋮ Near-sunflowers and focal families ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Applications of coding theory to communication combinatorial problems ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ Some new \(p\)-ary two-secure frameproof codes ⋮ Separable collusion-secure multimedia codes ⋮ Intersecting codes and separating codes ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

This page was built for publication: Separating Partition Systems and Locally Different Sequences