Frames as continuous redundant codes
From MaRDI portal
Publication:1980454
DOI10.3103/S002713222102008XzbMath1495.94123OpenAlexW3184737560MaRDI QIDQ1980454
Vladimir V. Galatenko, Albert R. Valiullin, Artur R. Valiullin
Publication date: 8 September 2021
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s002713222102008x
Cites Work
- Unnamed Item
- Unnamed Item
- Finite frames. Theory and applications.
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- Optimal frames for erasures.
- Recovery of signals from unordered partial frame coefficients
- Generalized approximate weak greedy algorithms
- Reconstruction of Signals From Frame Coefficients With Erasures at Unknown Locations
- Finite Frame Theory
- An Introduction to Frames
- Class of majority decodable real-number codes
- Fundamentals of Error-Correcting Codes
- On orthorecursive expansions with errors in the calculation of coefficients
- Quantized frame expansions with erasures
This page was built for publication: Frames as continuous redundant codes