Improved upper bounds for parent-identifying set systems and separable codes
A \(t\)-parent-identifying set system, or \(t\)-IPPS\((w,v)\), is a pair \((V,\mathcal{B})\) where \(V\) is a set of \(v\) elements and \(\mathcal{B}\) is a family of \(w\)-sized subsets of \(V\) with the property that, for any \(w\)-sized subset \(T\subseteq V\), either \[ P_t(T) = \emptyset\qquad\text{or}\quad \bigcap_{\mathcal{P}\in P_t(T)}\mathcal{P} \neq \emptyset\,, \] where \[ P_t(T) := \Big\{\mathcal{P}\subseteq \mathcal{B}\::\: |\mathcal{P}|\leq t\,,\;T\subseteq \bigcup_{B\in \mathcal{P}}B\Big\}\,. \] The author of this paper proves new upper bounds for \[ I_t(w,v) := \max\big\{|\mathcal{B}|\::\: (V,\mathcal{B}) \textrm{ is a \(t\)-IPPS\((w,v)\)}\} \] that sharpen several existing bounds in the literature. The authors generalises other existing results in the literature by proving that \(I_t(w,v) = v-w+1\) when \(w\leq \lfloor\frac{t^2}{4}+t\rfloor\). The author furthermore proves new and improved upper bounds for related combinatorial structures, the \(q\)-ary separable codes.
- 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
- 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
- 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?)
- 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 \(B_ 2\)-sequences of vectors
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Probabilistic Existence Results for Parent-Identifying Schemes
- Tracing traitors
- Upper bounds for parent-identifying set systems
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)
