Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves

DOI10.1109/TIT.2012.2196256zbMath1364.94696MaRDI QIDQ2989817

Gennian Ge, Fei Gao, Shengyuan Zhang, Shuxing Li

Publication date: 8 June 2017

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

Mathematics Subject Classification ID

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

Related Items (22)

Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ 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 ⋮ Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields ⋮ Performance analysis of the compressed distributed least squares algorithm ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Deterministic construction of compressed sensing matrices based on semilattices ⋮ Cayley sum graphs and their applications to codebooks ⋮ Bipolar measurement matrix using chaotic sequence ⋮ New bounds for RIC in compressed sensing ⋮ Noise folding in completely perturbed compressed sensing ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields ⋮ Chaotic Binary Sensing Matrices ⋮ An effective algorithm for the spark of sparse binary measurement matrices ⋮ Construction of Sparse Binary Sensing Matrices Using Set Systems ⋮ Welch bound-achieving compressed sensing matrices from optimal codebooks ⋮ Deterministic Construction of Compressed Sensing Matrices from Codes ⋮ Deterministic constructions of compressed sensing matrices based on codes ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs ⋮ 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