Bounds on the rate of separating codes

DOI10.1134/S0032946017010021zbMath1387.94133OpenAlexW2606846222MaRDI QIDQ1752294

I. V. Vorob'ev

Publication date: 24 May 2018

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946017010021

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)

Related Items

Traceability codes and their generalizations ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Separable collusion-secure multimedia codes

Cites Work

• Unnamed Item
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Key storage in secure networks
• Completely separating systems
• Separating systems
• Bounds on the rate of disjunctive codes
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On generalized separating hash families
• Interval Packing and Covering in the Boolean Lattice
• Robust Parent-Identifying Codes and Combinatorial Arrays
• Monotone Functions in Sequential Circuits
• Combinatorial properties of frameproof and traceability codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Collusion-secure fingerprinting for digital data
• Superimposed Codes and Threshold Group Testing