Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves

DOI10.1109/TIT.2012.2196256MaRDI QIDQ2989817zbMATH OpenFDO

Authors Shuxing Li, Fei Gao, Gennian Ge, Shengyuan Zhang

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2012.2196256

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects of algebraic curves (14Q05) Sampling theory in information and communication theory (94A20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited in

(25)

• Deterministic construction of compressed sensing matrices based on semilattices
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• Deterministic construction of compressed sensing matrices from constant dimension codes
• Bipolar measurement matrix using chaotic sequence
• An effective algorithm for the spark of sparse binary measurement matrices
• Deterministic constructions of compressed sensing matrices based on codes
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Performance analysis of the compressed distributed least squares algorithm
• Cayley sum graphs and their applications to codebooks
• Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
• Construction of sparse binary sensing matrices using set systems
• Deterministic convolutional compressed sensing matrices
• Coherence of sensing matrices coming from algebraic-geometric codes
• Deterministic construction of compressed sensing matrices with characters over finite fields
• New bounds for RIC in compressed sensing
• Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
• Welch bound-achieving compressed sensing matrices from optimal codebooks
• Deterministic construction of compressed sensing matrices from codes
• Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing
• Chaotic Binary Sensing Matrices
• Algebraic compressed sensing
• Noise folding in completely perturbed compressed sensing
• Structured measurement matrices based on deterministic Fourier matrices and Gram matrices
• Deterministic construction of sparse binary matrices via incremental integer optimization

This page was built for publication: Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989817)