Visualitza ICC_Articles per autoria "8f6be33c-c170-4ab0-8df8-0e347ea567e3"
Ara mostrant els elements 1-2 d 2
-
Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures
Quintana-Ortí, Gregorio; Hernando, Fernando; Igual, Francisco Association for Computing Machinery (ACM) (2023-03)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 ... -
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
Hernando, Fernando; Igual, Francisco; Quintana-Ortí, Gregorio Association for Computing Machinery (ACM) (2019-06)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. ...