|
This article is cited in 5 scientific papers (total in 5 papers)
Coding Theory
Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
M. Fernandeza, G. A. Kabatianskyb, S. A. Kruglikc, Y. Miaod a Universitat Politècnica de Catalunya, Barcelona, Spain
b Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
c Nanyang Technological University, Singapore
d University of Tsukuba, Tsukuba, Ibaraki, Japan
Abstract:
We construct codes that allow to exactly recover the support of an unknown sparse
vector with almost equal absolute values of all nonzero coordinates given results of linear measurements in the presence of noise with $\ell_p$-norm bounded from above. We propose a decoding
algorithm with asymptotically minimum complexity.
Keywords:
compressed sensing, sparse vector support, group testing, false coin problem, signature codes for a noisy multiple-access adder channel, multimedia digital fingerprinting codes.
Received: 30.12.2022 Revised: 21.02.2023 Accepted: 21.02.2023
Citation:
M. Fernandez, G. A. Kabatiansky, S. A. Kruglik, Y. Miao, “Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding”, Probl. Peredachi Inf., 59:1 (2023), 17–24; Problems Inform. Transmission, 59:1 (2023), 14–21
Linking options:
https://www.mathnet.ru/eng/ppi2389 https://www.mathnet.ru/eng/ppi/v59/i1/p17
|
|