17 citations · 55 across the 19 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.IT2016★ 17 cited
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
Fernando Hernando, Francisco D. Igual, Gregorio Quintana-Ortí
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…
cs.DC2016★ 1 cited
HeSP: a simulation framework for solving the task scheduling-partitioning problem on heterogeneous architectures
Anton Rey, Francisco D. Igual, Manuel Prieto-Matías
In this paper we describe HeSP, a complete simulation framework to study a general task scheduling-partitioning problem on heterogeneous architectures, which treats recursive task…