Welch bound-achieving compressed sensing matrices from optimal codebooks

DOI10.1142/S1793830920500421zbMath1459.94049OpenAlexW3011821305MaRDI QIDQ4965909

Gang Wang, You Gao, Min-Yao Niu

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

coherencesparsitycompressed sensingrestricted isometry propertycodebooks

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Unnamed Item
• Explicit constructions of RIP matrices and related problems
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Deterministic constructions of compressed sensing matrices
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Decoding by Linear Programming
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Matrices With Small Coherence Using $p$-Ary Block Codes
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Welch bound-achieving compressed sensing matrices from optimal codebooks