Answers are grounded in this paper and cite their sources.
Given a frame in Cnwhich satisfies a form of the uncertainty principle (as introduced by Candes and Tao), it is shown how to quickly convert the frame representation of every vector into a more robust Kashin's representation whose coefficients all have the smallest possible dynamic rangeO(1/√(n). The information tends to spread evenly among these coefficients. As a consequence, Kashin's representations have a great power for reduction of errors in their coefficients, including coefficient losses and distortions.
No takes yet. Share an insight, caveat, or question.
Lyubarskii et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: