Frames as continuous redundant codes
From MaRDI portal
Publication:1980454
DOI10.3103/S002713222102008XzbMATH Open1495.94123OpenAlexW3184737560MaRDI QIDQ1980454FDOQ1980454
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
- Title not available (Why is that?)
- Quantized frame expansions with erasures
- Fundamentals of Error-Correcting Codes
- Finite frames. Theory and applications.
- Title not available (Why is that?)
- Optimal frames for erasures.
- Reconstruction of Signals From Frame Coefficients With Erasures at Unknown Locations
- On orthorecursive expansions with errors in the calculation of coefficients
- Generalized approximate weak greedy algorithms
- An Introduction to Frames
- Recovery of signals from unordered partial frame coefficients
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- Finite Frame Theory
- Class of majority decodable real-number codes
Recommendations
- Frames as Codes π π
- Redundancy for localized frames π π
- Generalized frames and their redundancy π π
- Sequential and dynamic frameproof codes π π
- Redundancy of \(g\)-frames π π
- Construction of infinite frames with some given redundancy π π
- Title not available (Why is that?) π π
- Frameproof Codes π π
- Continuous Non-malleable Codes π π
- Asymptotic Frame Theory for Analog Coding π π
This page was built for publication: Frames as continuous redundant codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980454)