Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding

DOI10.1134/S0032946023010027MaRDI QIDQ6137610zbMATH OpenOpenAlexFDO

Authors Marcel Fernández, Grigory Kabatiansky, S. A. Kruglik, Ying Miao

Publication date 4 September 2023

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946023010027

zbMATH Keywords

compressed sensingfalse coin problemgroup testingmultimedia digital fingerprinting codessignature codes for noisy multiple-access adder channelsparse vector support

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Simple Codes and Sparse Recovery with Fast Decoding
• Decoding by Linear Programming
• Decoding low-dimensional linear codes by linear programming
• On exact recovery of sparse vectors from linear measurements
• Low-dimensional linear codes with high breakdown points by QR decomposition

Cites work

• A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
• Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
• Compressed sensing
• Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
• Expander codes
• Linear-time encodable and decodable error-correcting codes
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
• On error correction with errors in both the channel and syndrome
• Separable collusion-secure multimedia codes
• Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Superimposed codes in the Hamming space

Cited in

(5)

• On exact recovery of sparse vectors from linear measurements
• Simple Codes and Sparse Recovery with Fast Decoding
• Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
• Performance evaluation of Wi-Fi 7 networks with restricted target wake time
• Improving the stability of DFT error recovery codes by using sparse oversampling patterns

This page was built for publication: Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding

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