Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
type: Item
instance of: scholarly article
title: Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
author: Marcel Fernández
author: John Livieratos
author: Sebastià Martín
published in: Cryptography and Communications
publication date: 2024-07-11T00:00:00Z
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 7880153
zbMATH Keywords: frameproof codes
zbMATH Keywords: separable codes
zbMATH Keywords: \(B_2\) codes
zbMATH Keywords: Lovasz local lemma
zbMATH Keywords: Moser-Tardos algorithm
MaRDI profile type: Publication
cites work: Collusion-secure fingerprinting for digital data
cites work: On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
cites work: Separable Codes
cites work: Probabilistic Existence Results for Separable Codes
cites work: Determination of two vectors from the sum
cites work: Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen.
cites work: New Bounds for Frameproof Codes
cites work: A constructive proof of the Lovász local lemma
cites work: A constructive proof of the general lovász local lemma
cites work: Q3952016
cites work: Number of points of an algebraic curve
cites work: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
cites work: On the asymptotic behaviour of some towers of function fields over finite fields
cites work: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
cites work: Graph colouring and the probabilistic method
cites work: Generalized hashing and parent-identifying codes.
cites work: On certain inequalities involving the constant \(e\) and their applications
cites work: Identifying Traitors Using the Koetter–Vardy Algorithm
DOI: 10.1007/S12095-023-00682-Y
description: scientific article; zbMATH DE number 7880153