Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling

Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling

Bibliographic Details
Main Authors:	Donoho, D, Tanner, J
Format:	Journal article
Published:	2010

Similar Items

The polytope of Tesler matrices
by: Karola Mészáros, et al.
Published: (2015-01-01)

Constructing neighborly polytopes and oriented matroids
by: Arnau Padrol
Published: (2012-01-01)

Lower Bounds on the Column Sparsity of Compressed Sensing Matrices
by: Nachin, Mergen
Published: (2021)

Many neighborly inscribed polytopes and Delaunay triangulations
by: Bernd Gonska, et al.
Published: (2014-01-01)

On the number of facets of a 2-neighborly polytope
Published: (2010-03-01)

Exponential bounds on error probability with Feedback
by: Nakiboḡlu, Bariş
Published: (2011)

Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes
by: McKay, Dylan M., et al.
Published: (2021)

Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
by: Steven T Flammia, et al.
Published: (2012-01-01)

Recovery error bounds on compressed sensing of noisy signals
by: Rateb, Ahmad M., et al.
Published: (2015)

Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
by: Bah, B, et al.
Published: (2013)

A Uniform Asymptotical Upper Bound for the Variance of a Random Polytope in a Simple Polytope
by: A. Magazinov
Published: (2015-03-01)

A Uniform Asymptotical Upper Bound for the Variance of a Random Polytope in a Simple Polytope
by: A. Magazinov
Published: (2012-01-01)

Turán’s Theorem Implies Stanley’s Bound
by: Nikiforov V.
Published: (2020-05-01)

The detection bound of the probability of error in compressed sensing using Bayesian approach
by: Cao, Jiuwen, et al.
Published: (2013)

Some 0/1 polytopes need exponential size extended formulations
by: Rothvoss, Thomas
Published: (2016)

Almost simplicial polytopes: the lower and upper bound theorems
by: Eran Nevo, et al.
Published: (2020-04-01)

Combinatorics of colored factorizations, flow polytopes and of matrices over finite fields
by: Morales, Alejandro Henry
Published: (2012)

Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
by: Bah, B, et al.
Published: (2010)

On the Stability of a class of Polytopes of third order square matrices and stability radius
by: Efrén Vázquez Silva
Published: (2011-04-01)

Error detection and correction for coding theory on k-order Gaussian Fibonacci matrices
by: Suleyman Aydinyuz, et al.
Published: (2023-01-01)

Reordered Exponential Golomb Error Correction Code for Universal Near-Capacity Joint Source-Channel Coding
by: Alexander Hamilton, et al.
Published: (2023-01-01)

Can the energy bound E ≥ 0 imply supersymmetry?
by: Bae, J-B, et al.
Published: (2023)

On bounded partition dimension of different families of convex polytopes with pendant edges
by: Khali, Adnan, et al.
Published: (2021)

Computing bounds on network capacity regions as a polytope reconstruction problem
by: Kim, Anthony, et al.
Published: (2012)

Compressive Sensing in Image/Video Compression: Sampling, Coding, Reconstruction, and Codec Optimization
by: Jinjia Zhou, et al.
Published: (2024-01-01)

Compressive sensing using locality-preserving matrices
by: Grant, Elyot, et al.
Published: (2014)

Two-sided exponential concentration bounds for Bayes error rate and Shannon entropy
by: Honorio, Jean, et al.
Published: (2015)

Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma
by: Chen, Lijie, et al.
Published: (2022)

Error bounds for linear complementarity problems of strong $ SDD_{1} $ matrices and strong $ SDD_{1} $-$ B $ matrices
by: Yuanjie Geng, et al.
Published: (2023-09-01)

Bounds of restricted isometry constants in extreme asymptotics: Formulae for Gaussian matrices
by: Bah, B, et al.
Published: (2014)

Constructions and bounds on linear error-block codes
by: Ling, San, et al.
Published: (2013)

New lower bounds and constructions for binary codes correcting asymmetric errors
by: Fu, Fang-Wei, et al.
Published: (2013)

A new error bound for linear complementarity problems involving $ B- $matrices
by: Hongmin Mo, et al.
Published: (2023-08-01)

Gelfand―Tsetlin Polytopes and Feigin―Fourier―Littelmann―Vinberg Polytopes as Marked Poset Polytopes
by: Federico Ardila, et al.
Published: (2011-01-01)

Distinguishability of non-orthogonal density matrices does not imply violations of the second law
by: Mana, P
Published: (2004)

Exponentiation Representation of Boolean Matrices in the Framework of Semi-Tensor Product of Matrices
by: Jumei Yue, et al.
Published: (2019-01-01)

Minimal-Entanglement Entanglement-Assisted Quantum Error Correction Codes from Modified Circulant Matrices
by: Duc Manh Nguyen, et al.
Published: (2017-07-01)

Lectures on polytopes /
by: 445289 Ziegler, Gunter M
Published: (1995)

Regular polytopes/
by: Coxeter, H. S. M. (Harold Scott Macdonald), 1907-
Published: (1948)

Regular polytopes /
by: Coxeter, H. S. M. (Harold Scott Macdonald), 1907-
Published: (1973)