Listar por tema "linear codes"
Mostrando ítems 1-2 de 2
-
Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures
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
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. ...