Frameproof codes, separable codes and B₂ codes: bounds and constructions
From MaRDI portal
Publication:6571302
DOI10.1007/S12095-023-00682-YMaRDI QIDQ6571302FDOQ6571302
Authors: Marcel Fernández, John Livieratos, Sebastià Martín 
Publication date: 11 July 2024
Published in: Cryptography and Communications (Search for Journal in Brave)
Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- On the asymptotic behaviour of some towers of function fields over finite fields
- Generalized hashing and parent-identifying codes.
- On certain inequalities involving the constant \(e\) and their applications
- Graph colouring and the probabilistic method
- Collusion-secure fingerprinting for digital data
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- A constructive proof of the general Lovász local lemma
- New Bounds for Frameproof Codes
- Probabilistic Existence Results for Separable Codes
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Title not available (Why is that?)
- Number of points of an algebraic curve
- A constructive proof of the Lovász local lemma
- Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen.
- Determination of two vectors from the sum
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- Identifying Traitors Using the Koetter–Vardy Algorithm
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)
