En este trabajo se construyen matrices determinísticas para compressed sensing basados en códigos lineales. Para cada código lineal se exhibe una matriz de ceros y unos que resulta ser altamente dispersa.El comportamiento de esas matrices es comparado con algunas matrices clásicas aleatorias usadas en compressed sensing
In this work we construct deterministic compressed sensing matrices based in linear codes. For each linear code, we exhibit a measurement compressed sensing matrix consisting of zeros and ones. This results being highly sparse. The behavior of these matrices is compared with respect to some classical random compressed sensing matrices
