{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T03:16:13Z","timestamp":1770520573165,"version":"3.49.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish Ministry of Science, Innovation and Universities","award":["PGC2018-096446-B-C21 and PGC2018-096446-B-C22"],"award-info":[{"award-number":["PGC2018-096446-B-C21 and PGC2018-096446-B-C22"]}]},{"name":"University Jaume I","award":["PB1-1B2018-10"],"award-info":[{"award-number":["PB1-1B2018-10"]}]},{"name":"ERDF A way of making Europe","award":["S2018\/TCS-4423"],"award-info":[{"award-number":["S2018\/TCS-4423"]}]},{"name":"Madrid Government"},{"name":"Regional Programme of Research and Technological Innovation","award":["PR65-19\/22445"],"award-info":[{"award-number":["PR65-19\/22445"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>\n            The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this article, we introduce a family of implementations of the Brouwer\u2013Zimmermann algorithm for distributed-memory architectures for computing the minimum distance of a random linear code over \ud835\udd3d\n            <jats:sub>2<\/jats:sub>\n            . Both current commercial and public-domain software only work on either unicore architectures or shared-memory architectures, which are limited in the number of cores\/processors employed in the computation. Our implementations focus on distributed-memory architectures, thus being able to employ hundreds or even thousands of cores in the computation of the minimum distance. Our experimental results show that our implementations are much faster, even up to several orders of magnitude, than current implementations widely used nowadays.\n          <\/jats:p>","DOI":"10.1145\/3573383","type":"journal-article","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:23:25Z","timestamp":1670286205000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm\u00a01033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures"],"prefix":"10.1145","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7912-7826","authenticated-orcid":false,"given":"Gregorio","family":"Quintana-Ort\u00ed","sequence":"first","affiliation":[{"name":"Departamento de Ingenier\u00eda y Ciencia de Computadores Universitat Jaume I, Campus de Riu Sec, Castell\u00f3, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-2152","authenticated-orcid":false,"given":"Fernando","family":"Hernando","sequence":"additional","affiliation":[{"name":"Instituto Universitario de Matem\u00e1ticas y Aplicaciones de Castell\u00f3n and Departamento de Matem\u00e1ticas Universitat Jaume I, Campus de Riu Sec, Castell\u00f3, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4480-9517","authenticated-orcid":false,"given":"Francisco D.","family":"Igual","sequence":"additional","affiliation":[{"name":"Departamento de Arquitectura de Computadores y Autom\u00e1tica, Universidad Complutense de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.plrev.2004.01.002"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055578"},{"key":"e_1_3_1_4_2","unstructured":"R. Baart T. Boothby J. Cramwinckel J. Fields D. Joyner R. Miller E. Minkes E.and Roijackers L. Ruscio and C. Tjhai. 2012. GUAVA a GAP package for computing with error-correcting codes Version 3.12. Retrieved from http:\/\/www.southernct.edu\/. Accessed December 28 2022."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.01.003"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.3390\/math9192354"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205646"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2345375"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"e_1_3_1_11_2","unstructured":"The GAP Group. 2015. GAP \u2013 Groups Algorithms and Programming Version 4.7.8. Retrieved from http:\/\/www.gap-system.org. Accessed December 28 2022."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3302389"},{"key":"e_1_3_1_13_2","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"Kreher Donald L.","year":"1999","unstructured":"Donald L. Kreher and Douglas Robert Stinson. 1999. Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016.10.195"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.804244"},{"key":"e_1_3_1_17_2","series-title":"North-Holland Mathematical Library","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams F. J.","year":"1977","unstructured":"F. J. MacWilliams and Neil J. A. Sloane. 1977. The Theory of Error-Correcting Codes. Number 16 in North-Holland Mathematical Library. North-Holland Pub. Co."},{"key":"e_1_3_1_18_2","unstructured":"Elebeoba E. May Mladen A. Vouk Donald L. Bitzer and David I. Rosnick. 2002. A coding theory framework for genetic sequence analysis. In Proceedings of the Workshop on Genomic Signal Processing and Statistics."},{"issue":"4","key":"e_1_3_1_19_2","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"44","author":"McEliece R. J.","year":"1978","unstructured":"R. J. McEliece. 1978. A public-key cryptosystem based on algebraic coding theory. Deep Space Network Progress Report 44, 4 (1978), 114\u2013116.","journal-title":"Deep Space Network Progress Report"},{"issue":"2","key":"e_1_3_1_20_2","first-page":"159","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter H.","year":"1986","unstructured":"H. Niederreiter. 1986. Knapsack-type cryptosystems and algebraic coding theory. Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform. 15, 2 (1986), 159\u2013166.","journal-title":"Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform."},{"key":"e_1_3_1_21_2","unstructured":"OpenMP Architecture Review Board. 2008. OpenMP Application Program Interface Version 3.0. Retrieved from http:\/\/www.openmp.org\/mp-documents\/spec30.pdf. Accessed December 28 2022."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"e_1_3_1_25_2","volume-title":"Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes","author":"Zimmermann K. H.","year":"1996","unstructured":"K. H. Zimmermann. 1996. Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes. Techn. Univ. Hamburg-Harburg. Retrieved from https:\/\/books.google.es\/books?id=_2FamwEACAAJ."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3573383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3573383"],"URL":"https:\/\/doi.org\/10.1145\/3573383","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"2021-04-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}