Matrices With Small Coherence Using p-Ary Block Codes

DOI10.1109/TSP.2011.2169249MaRDI QIDQ4573435zbMATH OpenOpenAlexFDO

Authors Arash A. Amini, Vahid Montazerhodjat, Farokh Marvasti

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2011.2169249

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Sampling theory in information and communication theory (94A20) Convolutional codes (94B10)

Cited in

(10)

• 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
• Deterministic constructions of compressed sensing matrices based on codes
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Deterministic construction of compressed sensing matrices with characters over finite fields
• Welch bound-achieving compressed sensing matrices from optimal codebooks
• Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing
• Chaotic Binary Sensing Matrices
• Non-Cartesian spiral binary sensing matrices

This page was built for publication: Matrices With Small Coherence Using $p$-Ary Block Codes

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