Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
View/ Open
Impact
Scholar |
Other documents of the author: Hernando, Fernando; Igual, Francisco; Quintana-Ortí, Gregorio
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/173364
comunitat-uji-handle3:10234/173369
comunitat-uji-handle4:
INVESTIGACIONMetadata
Title
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear CodeDate
2019-06Publisher
Association for Computing Machinery (ACM)ISSN
0098-3500; 1557-7295Bibliographic citation
HERNANDO, Fernando; IGUAL, Francisco D.; QUINTANA-ORTÍ, Gregorio. Algorithm 994: Fast Implementations of the Brouwer-Zimmermann Algorithm for the Computation of the Minimum Distance of a Random Linear Code. ACM Transactions on Mathematical Software, 2019, vol. 45, no 2, p. 23.Type
info:eu-repo/semantics/articlePublisher version
https://dl.acm.org/citation.cfm?id=3302389Version
info:eu-repo/semantics/submittedVersionSubject
Abstract
The minimum distance of an error-correcting code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is crucial to many problems in this ... [+]
The minimum distance of an error-correcting code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is crucial to many problems in this area. In this article, we present and assess a family of implementations of both the brute-force algorithm and the Brouwer-Zimmermann algorithm for computing the minimum distance of a random linear code over that are faster than current implementations, both in the commercial and public domain. In addition to the basic sequential implementations, we present parallel and vectorized implementations that produce high performances on modern architectures. The attained performance results show the benefits of the developed optimized algorithms, which obtain remarkable improvements compared with state-of-the-art implementations widely used nowadays. [-]
Is part of
ACM Transactions on Mathematical Software, 2019, vol. 45, no 2Investigation project
Spanish Ministry of Economy: MTM2012-36917-C03-03 and MTM2015-65764-C3-2-P; University Jaume I: P1.1B2015-02. European Union (EU) FEDER; Spanish MINECO: TIN 2015-65277-R and TIN2012-32180Rights
Copyright © Association for Computing Machinery (ACM)
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
This item appears in the folowing collection(s)
- ICC_Articles [419]
- IMAC_Articles [121]