Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2016
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911858224529408 |
|---|---|
| author | Hernando, Fernando Igual, Francisco D. Quintana-Ortí, Gregorio |
| author_facet | Hernando, Fernando Igual, Francisco D. Quintana-Ortí, Gregorio |
| contents | The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present and evaluate a family of algorithms and implementations to compute the minimum distance of a random linear code over $\mathbb{F}_{2}$ that are faster than different current implementations. In addition to the basic sequential implementations, we present parallel and vectorized implementations that render high performances on modern architectures. The attained performance results show the benefits of the developed optimized algorithms, which obtain remarkable performance improvements compared with state-of-the-art implementations widely used nowadays. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1603_06757 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code Hernando, Fernando Igual, Francisco D. Quintana-Ortí, Gregorio Information Theory 68Q30, 68Q25, 65F30, 11Y16 The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present and evaluate a family of algorithms and implementations to compute the minimum distance of a random linear code over $\mathbb{F}_{2}$ that are faster than different current implementations. In addition to the basic sequential implementations, we present parallel and vectorized implementations that render high performances on modern architectures. The attained performance results show the benefits of the developed optimized algorithms, which obtain remarkable performance improvements compared with state-of-the-art implementations widely used nowadays. |
| title | Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code |
| topic | Information Theory 68Q30, 68Q25, 65F30, 11Y16 |
| url | https://arxiv.org/abs/1603.06757 |