Improved upper bounds for parent-identifying set systems and separable codes
From MaRDI portal
Recommendations
- Upper bounds for parent-identifying set systems
- New upper bounds for parent-identifying codes and traceability codes
- On 2-parent-identifying set systems of block size 4
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
- An upper bound on the size of a code with the \(k\)-identifiable parent property
Cites work
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A new upper bound on nonbinary block codes
- Binary \(B_2\)-sequences: a new upper bound
- Bounds on Traceability Schemes
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Cycles of even length in graphs
- Determination of two vectors from the sum
- Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
- New upper bounds on error exponents
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On 2-parent-identifying set systems of block size 4
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- On \(B_ 2\)-sequences of vectors
- Probabilistic Existence Results for Parent-Identifying Schemes
- Tracing traitors
- Upper bounds for parent-identifying set systems
Cited in
(5)
This page was built for publication: Improved upper bounds for parent-identifying set systems and separable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220762)
