On the Compressed Measurements over Finite Fields: Sparse or Dense Sampling
classification
💻 cs.IT
math.IT
keywords
compressedfieldsfinitedensematricesmeasurementssamplingsensing
read the original abstract
We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the finite fields are varied. One of interesting conclusions includes that unless the signal is "ultra" sparse, the sensing matrices do not have to be dense.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.