Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions-Reference-Cited by-同舟云学术

Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions

Published:2023-11-10 Issue: Volume: Page:
ISSN:1936-2447
Container-title:Cryptography and Communications
language:en
Short-container-title:Cryptogr. Commun.

Author:

Fernandez Marcel,Livieratos John,Martín Sebastià

Abstract

AbstractIn this paper, constructions of frameproof codes, separable codes, and

$$B_2$$

B 2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes. The obtained bounds match all best known bounds in the literature. Our strategy allows us to present constructions of the aforementioned codes, by using the variable framework for the Lovász Local Lemma.

Funder

Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España

Ministerio de Ciencia, Innovación y Universidades

Universitat Politècnica de Catalunya

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications

Link

https://link.springer.com/content/pdf/10.1007/s12095-023-00682-y.pdf

Reference24 articles.

1. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE transactions on information theory 44(5), 1897–1905 (1998)

2. Cheng, M., Miao, Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE transactions on information theory 57(7), 4843–4851 (2011)

3. Cheng, M., Ji, L., Miao, Y.: Separable codes. IEEE Trans Inf Theor 58(3), 1791–1803 (2012)

4. Blackburn, S.R.: Probabilistic existence results for separable codes. IEEE Trans Inf Theor 61(11), 5822–5827 (2015)

5. Egorova, E., Fernandez, M., Kabatiansky, G., Lee, M.H.: Signature codes for the a-channel and collusion-secure multimedia fingerprinting codes. In: 2016 IEEE international symposium on information theory (ISIT), pp 3043–3047 (2016)