Matrices With Small Coherence Using $p$-Ary Block Codes

DOI10.1109/TSP.2011.2169249zbMath1393.94668OpenAlexW2090778665MaRDI QIDQ4573435

Arash A. Amini, Vahid Montazerhodjat, Farokh A. 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)

Related Items (10)

Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ 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 ⋮ Non-Cartesian spiral binary sensing matrices ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Chaotic Binary Sensing Matrices ⋮ Welch bound-achieving compressed sensing matrices from optimal codebooks ⋮ 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

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