Geometric approach to error correcting codes and reconstruction of signals

Mark Rudelson, Roman Vershynin

Type: Preprint

Publication Date: 2005-01-01

Citations: 21

DOI: https://doi.org/10.48550/arxiv.math/0502299

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements	2006	Mark Rudelson Roman Vershynin
+	Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements	2006	Mark Rudelson Roman Vershynin
+	Counting faces of randomly-projected polytopes when the projection radically lowers dimension	2006	David L. Donoho Jared Tanner
+ PDF Chat	Decoding by Linear Programming	2005	Emmanuel J. Candès Terence Tao
+	Error bounds for consistent reconstruction: random polytopes and coverage processes	2014	Alexander M. Powell J. Tyler Whitehouse
+	Error bounds for consistent reconstruction: random polytopes and coverage processes	2014	Alexander M. Powell J. Tyler Whitehouse
+	On sparse reconstruction from Fourier and Gaussian measurements	2007	Mark Rudelson Roman Vershynin
+	Modern Problems in Mathematical Signal Processing: Quantized Compressed Sensing and Randomized Neural Networks	2019	Aaron A. Nelson
+	One-bit compressed sensing by linear programming	2011	Yaniv Plan Roman Vershynin
+	One-bit compressed sensing by linear programming	2011	Yaniv Plan Roman Vershynin
+ PDF Chat	Quantized Compressed Sensing by Rectified Linear Units	2021	Hans Christian Jung Johannes Maly Lars Palzer Alexander Stollenwerk
+ PDF Chat	Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements	2006	Mark Rudelson Roman Vershynin
+	Dense Error Correction via L1-Minimization	2008	John Wright Yi Ma
+ PDF Chat	Error Bounds for Consistent Reconstruction: Random Polytopes and Coverage Processes	2015	Alexander M. Powell J. Tyler Whitehouse
+	Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals	2008	Venkatesan Guruswami James R. Lee Avi Wigderson
+	Combining geometry and combinatorics: A unified approach to sparse signal recovery	2008	Radu Berinde Anna C. Gilbert Piotr Indyk Howard Karloff Michael Strauss
+	Combinatorial methods in coding theory	2011	Alexander Barg Arya Mazumdar
+	Quantized Compressed Sensing by Rectified Linear Units	2019	Hans Christian Jung Johannes Maly Lars Palzer Alexander Stollenwerk
+	Linear dimension reduction approximately preserving a function of the 1-norm	2020	Michael P. Casey
+	Linear Dimension Reduction Approximately Preserving a Function of the 1-Norm	2019	Michael P. Casey

Works That Cite This (10)

Action	Title	Year	Authors
+ PDF Chat	How Neighborly Can a Centrally Symmetric Polytope Be?	2006	Nathan Linial Isabella Novik
+ PDF Chat	High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension	2005	David L. Donoho
+ PDF Chat	Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments	2009	Elaine Hale Wotao Yin Yin Zhang
+ PDF Chat	Multiple pattern classification by sparse subspace decomposition	2009	Tomoya Sakai
+ PDF Chat	Sparse Recovery With Unknown Variance: A LASSO-Type Approach	2014	Stéphane Chrétien Sébastien Darses
+ PDF Chat	Sparse Signal Reconstruction via Iterative Support Detection	2010	Yilun Wang Wotao Yin
+	Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse	2008	David L. Donoho Yaakov Tsaig
+	Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework	2011	Weiyu Xu Babak Hassibi
+ PDF Chat	Channel protection: Random coding meets sparse channels	2009	M. Salman Asif William Mantzel Justin Romberg
+ PDF Chat	Error correction via linear programming	2005	Emmanuel J. Candès Mark Rudelson Terence Tao Roman Vershynin

Works Cited by This (15)

Action	Title	Year	Authors
+ PDF Chat	Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization	2005	Joel A. Tropp
+	None	2003	Peter G. Casazza Jelena Kovačević
+ PDF Chat	The Concentration of Measure Phenomenon	2005	Michel Ledoux
+	Breakdown of equivalence between the minimal<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si120.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mo>ℓ</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>-norm solution and the sparsest solution	2005	Yaakov Tsaig David L. Donoho
+	For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution	2006	David L. Donoho
+	Unconditional and symmetric sets inn-dimensional normed spaces	1980	D. Amir Vitali Milman
+ PDF Chat	Proportional concentration phenomena on the sphere	2002	Shiri Artstein
+	Uncertainty principles and ideal atomic decomposition	2001	David L. Donoho Xiaoming Huo
+	For most large underdetermined systems of equations, the minimal 𝓁<sub>1</sub>‐norm near‐solution approximates the sparsest near‐solution	2006	David L. Donoho
+ PDF Chat	Sparse representations in unions of bases	2003	Rémi Gribonval Morten Nielsen