Frames as continuous redundant codes
From MaRDI portal
Publication:1980454
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
- Binary frames
- Frameproof Codes
- Continuous non-malleable codes
- Asymptotic frame theory for analog coding
Cites work
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- An Introduction to Frames
- Class of majority decodable real-number codes
- Codes for error detection.
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- Finite Frame Theory
- Finite frames. Theory and applications.
- Fundamentals of Error-Correcting Codes
- Generalized approximate weak greedy algorithms
- On orthorecursive expansions with errors in the calculation of coefficients
- Optimal frames for erasures.
- Quantized frame expansions with erasures
- Reconstruction of Signals From Frame Coefficients With Erasures at Unknown Locations
- Recovery of signals from unordered partial frame coefficients
Cited in
(2)
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)
