Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions

DOI10.1007/s12095-023-00682-yMaRDI QIDQ6571302

Marcel Fernandez, Sebastià Martín, John Livieratos

Publication date: 11 July 2024

Published in: Cryptography and Communications (Search for Journal in Brave)

zbMATH Keywords

frameproof codesLovasz local lemmaseparable codes\(B_2\) codesMoser-Tardos algorithm

Mathematics Subject Classification ID

Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen.
• Number of points of an algebraic curve
• 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
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Probabilistic Existence Results for Separable Codes
• 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
• New Bounds for Frameproof Codes
• Collusion-secure fingerprinting for digital data
• A constructive proof of the Lovász local lemma
• Separable Codes
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Identifying Traitors Using the Koetter–Vardy Algorithm
• Determination of two vectors from the sum
• Graph colouring and the probabilistic method

This page was built for publication: Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions