{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T10:18:26Z","timestamp":1770805106731,"version":"3.50.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TCO-RISEBLOCK (PID2019-110224RB-I00)"],"award-info":[{"award-number":["TCO-RISEBLOCK (PID2019-110224RB-I00)"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003359","name":"Generalitat Valenciana","doi-asserted-by":"crossref","award":["CIPROM\/2022\/20"],"award-info":[{"award-number":["CIPROM\/2022\/20"]}],"id":[{"id":"10.13039\/501100003359","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Spanish Ministery of Science and Innovation","award":["PID2021-125736OB-I00 (MCIN\/AEI \/10.13039\/501100011033\/"],"award-info":[{"award-number":["PID2021-125736OB-I00 (MCIN\/AEI \/10.13039\/501100011033\/"]}]},{"DOI":"10.13039\/501100004233","name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004233","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper addresses the generation of binary 2-separating codes and the study of the code rates that can be achieved in practice. In the case of binary 2-separating codes, there exist lower and upper theoretical bounds in the rates that can be achieved. The generation of 2-separating codes has been studied from a theoretical point of view, but, as far as we know, it has not been tackled from a practical point of view. In this paper, we consider and analyze two different generation algorithms. Both algorithms were implemented in CUDA and executed in GPUs, for the sake of efficiency. The first algorithm is inspired by the Moser\u2013Tardos algorithm, which is based on the Local Lov\u00e1sz Lemma. This algorithm has a strong theoretical appeal; codes obtained through this first algorithm can be shown to match the best known lower bound. To generate codes with rates as large as possible, a second algorithm has been implemented. The rates achieved are larger than those achieved with the first algorithm, but they still are very far from the theoretical upper bound. The results obtained suggest that the theoretical upper bound can probably be improved.<\/jats:p>","DOI":"10.1007\/s11227-026-08280-4","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T05:20:21Z","timestamp":1770787221000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gpu generation of binary 2-separating codes"],"prefix":"10.1007","volume":"82","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. J.","family":"Martinez-Zaldivar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor M.","family":"Garcia-Molla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Angeles","family":"Simarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Gonzalez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,11]]},"reference":[{"key":"8280_CR1","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"Advances in Cryptology \u2013 CRYPT0\u2019 95","author":"D Boneh","year":"1995","unstructured":"Boneh D, Shaw J (1995) Collusion-secure fingerprinting for digital data. In: Coppersmith D (ed) Advances in Cryptology \u2013 CRYPT0\u2019 95. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 452\u2013465"},{"key":"8280_CR2","doi-asserted-by":"publisher","first-page":"5257","DOI":"10.1109\/TIT.2014.2331989","volume":"60","author":"F Gao","year":"2014","unstructured":"Gao F, Ge G (2014) New bounds on separable codes for multimedia fingerprinting. Inf Theory IEEE Trans 60:5257\u20135262","journal-title":"Inf Theory IEEE Trans"},{"issue":"4","key":"8280_CR3","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A Barg","year":"2003","unstructured":"Barg A, Blakley GR, Kabatiansky GA (2003) Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans Inf Theory 49(4):852\u2013865","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"8280_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jcta.2007.04.005","volume":"115","author":"D Stinson","year":"2008","unstructured":"Stinson D, Wei R, Chen K (2008) On generalized separating hash families. J Comb Theory Series A 115(1):105\u2013120","journal-title":"J Comb Theory Series A"},{"issue":"2","key":"8280_CR5","first-page":"14","volume":"30","author":"YL Sagalovich","year":"1994","unstructured":"Sagalovich YL (1994) Separating systems. Probl Peredachi Informatsii 30(2):14\u201335","journal-title":"Probl Peredachi Informatsii"},{"issue":"1","key":"8280_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-015-0060-z","volume":"80","author":"J Moreira","year":"2016","unstructured":"Moreira J, Fern\u00e1ndez M, Kabatiansky G (2016) Almost separating and almost secure frameproof codes over q-ary alphabets. Des Codes Cryptogr 80(1):11\u201328","journal-title":"Des Codes Cryptogr"},{"issue":"3","key":"8280_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0401035","volume":"1","author":"J K\u00f6rner","year":"1988","unstructured":"K\u00f6rner J, Simonyi G (1988) Separating partition systems and locally different sequences. SIAM J Discret Math 1(3):355\u2013359","journal-title":"SIAM J Discret Math"},{"issue":"3","key":"8280_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1134\/S0032946022030048","volume":"58","author":"IV Vorob\u2019ev","year":"2022","unstructured":"Vorob\u2019ev IV, Lebedev VS (2022) Improved upper bounds for the rate of separating and completely separating codes. Probl Inf Transm 58(3):242\u2013253","journal-title":"Probl Inf Transm"},{"key":"8280_CR9","first-page":"609","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s P, Lov\u00e1sz L (1975) Problems and results on 3-chromatic hypergraphs and some related questions. Infinite Finite Sets 10:609\u2013627","journal-title":"Infinite Finite Sets"},{"key":"8280_CR10","doi-asserted-by":"crossref","unstructured":"Giotis I, Kirousis L, Psaromiligkos KI, Thilikos DM. On the algorithmic Lov\u00e1sz local lemma and acyclic edge coloring, In: Proceedings of the twelfth workshop on analytic algorithmics and combinatorics, Society for Industrial and Applied Mathematics, 2015, pp. 16\u201325","DOI":"10.1137\/1.9781611973761.2"},{"key":"8280_CR11","doi-asserted-by":"crossref","unstructured":"Fernandez M, Livieratos J. Algorithmic aspects on the construction of separating codes, in: Analysis of Experimental Algorithms - Special Event, SEA$${^2}$$ 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, Vol. 11544 of Lecture Notes in Computer Science, Springer, 2019, pp. 513\u2013526","DOI":"10.1007\/978-3-030-34029-2_33"},{"key":"8280_CR12","unstructured":"NVIDIA corporation, NVIDIA CUDA compute unified device architecture programming guide, NVIDIA Corporation, 2007"},{"key":"8280_CR13","doi-asserted-by":"crossref","unstructured":"Moser RA. A constructive proof of the Lov\u00e1sz local lemma, In: Proceedings 41st Annual ACM Symposium on Theory of Computing (STOC), ACM, 2009, pp. 343\u2013350","DOI":"10.1145\/1536414.1536462"},{"issue":"2","key":"8280_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser RA, Tardos G (2010) A constructive proof of the general Lov\u00e1sz local lemma. J ACM (JACM) 57(2):11","journal-title":"J ACM (JACM)"},{"key":"8280_CR15","unstructured":"MATLAB, version 9.8.0.1323502 (R2020a), Natick, Massachusetts, 2020"},{"key":"8280_CR16","unstructured":"MATLAB, Parallel computing toolbox version 7.2 (r2020a) (2022)"},{"key":"8280_CR17","doi-asserted-by":"publisher","unstructured":"Mart\u00ednez-Zald\u00edvar FJ, Garcia-Molla VM, Fernandez M, Simarro MA, Livieratos J, Gonzalez A. Software for gpu generation of binary 2-separating codes (2026). https:\/\/doi.org\/10.5281\/zenodo.18176312","DOI":"10.5281\/zenodo.18176312"},{"key":"8280_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(77)90044-9","volume":"20","author":"J Spencer","year":"1977","unstructured":"Spencer J (1977) Asymptotic lower bounds for Ramsey functions. Discret Math 20:69\u201376","journal-title":"Discret Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08280-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08280-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08280-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T05:20:25Z","timestamp":1770787225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08280-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,11]]},"references-count":18,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["8280"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08280-4","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,11]]},"assertion":[{"value":"19 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"149"}}