Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields

DOI10.1142/S0219498816500250zbMath1403.94029OpenAlexW2086444008MaRDI QIDQ2788564

You Gao, Xiao-Juan Zhang

Publication date: 19 February 2016

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498816500250

zbMATH Keywords

finite fieldssymplectic spacesingular symplectic spacecompressed sensing matrix

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (4)

Deterministic construction of compressed sensing matrices with characters over finite fields ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Deterministic constructions of compressed sensing matrices based on codes

Cites Work

• Explicit constructions of RIP matrices and related problems
• The restricted isometry property and its implications for compressed sensing
• Pooling spaces and non-adaptive pooling designs
• Deterministic constructions of compressed sensing matrices
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing

This page was built for publication: Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields