{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:28Z","timestamp":1740148948271,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Asuntos Econ\u00f3micos y Transformaci\u00f3n Digital, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["PID2019-110224RB-I00"],"award-info":[{"award-number":["PID2019-110224RB-I00"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PID2019-109379RB-I00"],"award-info":[{"award-number":["PID2019-109379RB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014374","name":"Universitat Polit\u00e8cnica de Catalunya","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014374","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, constructions of frameproof codes, separable codes, and <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> codes are obtained. For each family of codes, the Lov\u00e1sz 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\u00e1sz Local Lemma.<\/jats:p>","DOI":"10.1007\/s12095-023-00682-y","type":"journal-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T09:02:21Z","timestamp":1699606941000},"page":"481-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions"],"prefix":"10.1007","volume":"16","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e0","family":"Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,10]]},"reference":[{"issue":"5","key":"682_CR1","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE transactions on information theory 44(5), 1897\u20131905 (1998)","journal-title":"IEEE transactions on information theory"},{"issue":"7","key":"682_CR2","doi-asserted-by":"publisher","first-page":"4843","DOI":"10.1109\/TIT.2011.2146130","volume":"57","author":"M Cheng","year":"2011","unstructured":"Cheng, M., Miao, Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE transactions on information theory 57(7), 4843\u20134851 (2011)","journal-title":"IEEE transactions on information theory"},{"issue":"3","key":"682_CR3","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1109\/TIT.2011.2174614","volume":"58","author":"M Cheng","year":"2012","unstructured":"Cheng, M., Ji, L., Miao, Y.: Separable codes. IEEE Trans Inf Theor 58(3), 1791\u20131803 (2012)","journal-title":"Separable codes. IEEE Trans Inf Theor"},{"issue":"11","key":"682_CR4","doi-asserted-by":"publisher","first-page":"5822","DOI":"10.1109\/TIT.2015.2473848","volume":"61","author":"SR Blackburn","year":"2015","unstructured":"Blackburn, S.R.: Probabilistic existence results for separable codes. IEEE Trans Inf Theor 61(11), 5822\u20135827 (2015)","journal-title":"IEEE Trans Inf Theor"},{"key":"682_CR5","doi-asserted-by":"crossref","unstructured":"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\u20133047 (2016)","DOI":"10.1109\/ISIT.2016.7541858"},{"key":"682_CR6","doi-asserted-by":"crossref","unstructured":"Lindstr\u00f6m, B.: Determination of two vectors from the sum. J. Combin. Theor, Series A 6, 402\u2013407 (1969)","DOI":"10.1016\/S0021-9800(69)80038-4"},{"key":"682_CR7","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01455900","volume":"106","author":"S Sidon","year":"1932","unstructured":"Sidon, S.: Ein satz \u00fcber trigonometrische polynome und seine anwendung in der theorie der fourier-reihen. Mathematische Annalen 106, 536\u2013539 (1932)","journal-title":"Mathematische Annalen"},{"issue":"1","key":"682_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/LCOMM.2019.2945948","volume":"24","author":"Y Gu","year":"2020","unstructured":"Gu, Y., Fan, J., Miao, Y.: Improved bounds for Separable codes and $${B}_2$$ codes. IEEE communications letters 24(1), 15\u201319 (2020)","journal-title":"IEEE communications letters"},{"issue":"11","key":"682_CR9","doi-asserted-by":"publisher","first-page":"7247","DOI":"10.1109\/TIT.2017.2745619","volume":"63","author":"C Shangguan","year":"2017","unstructured":"Shangguan, C., Wang, X., Ge, G., Miao, Y.: New bounds for frameproof codes. IEEE transactions on information theory 63(11), 7247\u20137252 (2017)","journal-title":"IEEE transactions on information theory"},{"key":"682_CR10","unstructured":"Giotis, I., Kirousis, L., Psaromiligkos, K.I., Thilikos, D.M.: On the algorithmic Lov\u00e1sz local lemma and acyclic edge coloring. In: Proceedings of the twelfth workshop on analytic algorithmics and combinatorics (2015). Soc. Ind. Appl. Math"},{"key":"682_CR11","doi-asserted-by":"crossref","unstructured":"Moser, R.A.: A constructive proof of the Lov\u00e1sz local lemma. In: Proceedings 41st annual acm symposium on theory of computing (STOC), pp. 343\u2013350 (2009). ACM","DOI":"10.1145\/1536414.1536462"},{"issue":"2","key":"682_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM (JACM) 57(2), 11 (2010)","journal-title":"J. ACM (JACM)"},{"key":"682_CR13","volume-title":"Concatenated Codes","author":"GD Forney","year":"1966","unstructured":"Forney, G.D.: Concatenated Codes. MIT Press, Cambridge, MA (1966)"},{"key":"682_CR14","first-page":"170","volume":"24","author":"VD Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Sov. Math.-Dokl. 24, 170\u2013172 (1981)","journal-title":"Sov. Math.-Dokl."},{"key":"682_CR15","doi-asserted-by":"crossref","unstructured":"Vl\u01cedu\u0163, S., Drinfeld, V.: Number of points of an algebraic curve. Functional Analysis and Its Applications - Funct Anal Appl-Engl tr. 17, 53\u201354 (1983)","DOI":"10.1007\/BF01083182"},{"key":"682_CR16","doi-asserted-by":"crossref","unstructured":"Garcia, A., Stichtenoth, H.: A tower of Artin - Schreier extensions of Function Fields attaining the Drinfeld - Vl\u00e2dut bound. Inventiones Mathematicae 121, 211\u2013222 (1995)","DOI":"10.1007\/BF01884295"},{"issue":"2","key":"682_CR17","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Num. Theor. 61(2), 248\u2013273 (1996)","journal-title":"J. Num. Theor."},{"key":"682_CR18","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K Shum","year":"2001","unstructured":"Shum, K., Aleshnikov, I., Kumar, P., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the gilbert-varshamov bound. Information Theory, IEEE Transactions on 47, 2225\u20132241 (2001)","journal-title":"Information Theory, IEEE Transactions on"},{"key":"682_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Springer (2002)"},{"key":"682_CR20","unstructured":"Livieratos, J.: Constraint satisfaction problems: Probabilistic approach and applications to social choice theory. PhD thesis, National and Kapodistrian University of Athens, Department of Mathematics (2020)"},{"key":"682_CR21","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"2013","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Addison-Wesley (2013)"},{"key":"682_CR22","doi-asserted-by":"crossref","unstructured":"Alon, N., Cohen, G., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. J. Combin. Theory, Series A 104(1), 207\u2013215 (2003)","DOI":"10.1016\/j.jcta.2003.08.001"},{"issue":"2","key":"682_CR23","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1006\/jmaa.2000.6911","volume":"249","author":"J Sandor","year":"2000","unstructured":"Sandor, J., Debnath, L.: On certain inequalities involving the constant e and their applications. J. Math. Anal. Appl. 249(2), 569\u2013582 (2000)","journal-title":"J. Math. Anal. Appl."},{"key":"682_CR24","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1109\/TIT.2010.2095194","volume":"57","author":"M Fernandez","year":"2011","unstructured":"Fernandez, M., Moreira, J., Soriano, M.: Identifying traitors using the koetter-vardy algorithm. Information Theory, IEEE Transactions on 57, 692\u2013704 (2011)","journal-title":"Information Theory, IEEE Transactions on"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00682-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00682-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00682-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T09:13:13Z","timestamp":1713863593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00682-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["682"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00682-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2023,11,10]]},"assertion":[{"value":"1 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This manuscript has not been submitted to any other journal for simultaneous consideration.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to participate"}},{"value":"Yes","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}