Bounds on the rate of separating codes

DOI10.1134/S0032946017010021MaRDI QIDQ1752294zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Upper Bounds on Separating Codes
• Improved upper bounds for the rate of separating and completely separating codes
• LATIN 2004: Theoretical Informatics
• Bounds on the rate of disjunctive codes
• Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
• scientific article; zbMATH DE number 1803256
• A bound for divisible codes
• Probabilistic Existence Results for Separable Codes
• On pair-separating codes
• Cryptography and Coding

Cites work

• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Bounds on the rate of disjunctive codes
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Completely separating systems
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Families of finite sets in which no intersection of sets is covered by the union of s others
• scientific article; zbMATH DE number 3637293 (Why is no real title available?)
• Interval packing and covering in the Boolean lattice
• Key storage in secure networks
• Monotone Functions in Sequential Circuits
• On generalized separating hash families
• Robust Parent-Identifying Codes and Combinatorial Arrays
• Separating systems
• Superimposed codes and threshold group testing

Cited in

(14)

• New upper bounds on cardinality of separating systems
• On pair-separating codes
• Separable collusion-secure multimedia codes
• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• Traceability codes and their generalizations
• Bounds on the rate of disjunctive codes
• Upper Bounds on Separating Codes
• \((2,1)\)-separating systems beyond the probabilistic bound
• Cover-free codes and separating system codes
• Cryptography and Coding
• Cryptography and Coding
• Improved upper bounds for the rate of separating and completely separating codes
• Combinatorial constructions of separating codes
• Constructions of \(\bar{3}\)-separable codes with length 4

This page was built for publication: Bounds on the rate of separating codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752294)