Frameproof codes, separable codes and B₂ codes: bounds and constructions
From MaRDI portal
Publication:6571302
Recommendations
- A tight bound for frameproof codes viewed in terms of separating hash families
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- Combinatorial constructions of separating codes
- New results on frame-proof codes and traceability schemes
- On tight bounds for binary frameproof codes
Cites work
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- A constructive proof of the Lovász local lemma
- A constructive proof of the general Lovász local lemma
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Collusion-secure fingerprinting for digital data
- Determination of two vectors from the sum
- Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen.
- Generalized hashing and parent-identifying codes.
- Graph colouring and the probabilistic method
- Identifying Traitors Using the Koetter–Vardy Algorithm
- New Bounds for Frameproof Codes
- Number of points of an algebraic curve
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- On certain inequalities involving the constant e and their applications
- On the asymptotic behaviour of some towers of function fields over finite fields
- Probabilistic Existence Results for Separable Codes
- Separable Codes
This page was built for publication: Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571302)
