Asymptotic bounds on frameproof codes
From MaRDI portal
Recommendations
Cited in
(17)- Improved bounds on 2-frameproof codes with length 4
- New bounds on 2-frameproof codes of length 4
- Wide-sense 2-frameproof codes
- Sliding-window dynamic frameproof codes
- On generalized separating hash families
- Improved Constructions of Frameproof Codes
- Almost separating and almost secure frameproof codes over q-ary alphabets
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
- \((2,1)\)-separating systems beyond the probabilistic bound
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- New results on frame-proof codes and traceability schemes
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Comments on "New results on frame-proof codes and traceability schemes
- Separation and Witnesses
- New upper bounds for wide-sense frameproof codes
- Constructions of \(\bar{3}\)-separable codes with length 4
- On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
This page was built for publication: Asymptotic bounds on frameproof codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677620)