Results 11 to 20 of about 4,256 (49)
Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction
, 2012 Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large) components the other
Barbier, Jean +3 more
core +2 more sources
Improving compressed sensing with the diamond norm
, 2016 In low-rank matrix recovery, one aims to reconstruct a low-rank matrix from a minimal number of linear measurements. Within the paradigm of compressed sensing, this is made computationally efficient by minimizing the nuclear norm as a convex surrogate ...
Eisert, Jens +3 more
core +1 more source
Euclidean and Hermitian LCD MDS codes
, 2017 Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks.
Carlet, Claude +3 more
core +2 more sources
Distributed Compressed Sensing off the Grid
, 2014 This letter investigates the joint recovery of a frequency-sparse signal ensemble sharing a common frequency-sparse component from the collection of their compressed measurements.
Jiang, Sumxin +4 more
core +1 more source
Compressed Sensing Performance Analysis via Replica Method using Bayesian framework [PDF]
, 2014 Compressive sensing (CS) is a new methodology to capture signals at lower rate than the Nyquist sampling rate when the signals are sparse or sparse in some domain.
Barzideh, Faraz +2 more
core
The Third-Order Term in the Normal Approximation for the AWGN Channel
, 2013 This paper shows that, under the average error probability formalism, the third-order term in the normal approximation for the additive white Gaussian noise channel with a maximal or equal power constraint is at least $\frac{1}{2} \log n + O(1)$.
Tan, Vincent Y. F., Tomamichel, Marco
core +1 more source
Lengthening and Extending Binary Private Information Retrieval Codes
, 2018 It was recently shown by Fazeli et al. that the storage overhead of a traditional $t$-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a $t$-server PIR code.
Lin, Hsuan-Yin, Rosnes, Eirik
core +1 more source
, 2017 In this paper, we propose a novel joint coding-modulation technique based on serial concatenation of orthogonal linear transform, such as discrete Fourier transform (DFT) or Walsh-Hadamard transform (WHT), with memoryless nonlinearity.
Zhidkov, Sergey V.
core +1 more source
Pl\"ucker Embedding of Cyclic Orbit Codes [PDF]
, 2012 Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.Comment: to appear in ...
Trautmann, Anna-Lena
core
"Compressed" Compressed Sensing
, 2010 The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples).
Gastpar, Michael, Reeves, Galen
core