Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
DOI10.1134/S0032946023010027OpenAlexW4386237316MaRDI QIDQ6137610FDOQ6137610
Ying Miao, Marcel Fernández, S. A. Kruglik, Grigory Kabatiansky
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
compressed sensinggroup testingfalse coin problemmultimedia digital fingerprinting codessignature codes for noisy multiple-access adder channelsparse vector support
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed sensing
- On error correction with errors in both the channel and syndrome
- Expander codes
- Linear-time encodable and decodable error-correcting codes
- Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
- Superimposed codes in the Hamming space
- Separable collusion-secure multimedia codes
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
Cited In (5)
- Improving the stability of DFT error recovery codes by using sparse oversampling patterns
- Simple Codes and Sparse Recovery with Fast Decoding
- Performance evaluation of Wi-Fi 7 networks with restricted target wake time
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
- On exact recovery of sparse vectors from linear measurements
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)
