Results 11 to 20 of about 4,247 (48)
Scampi: a robust approximate message-passing framework for compressive imaging
, 2015 Reconstruction of images from noisy linear measurements is a core problem in image processing, for which convex optimization methods based on total variation (TV) minimization have been the long-standing state-of-the-art.
Barbier, Jean +2 more
core +1 more source
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
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
An Algorithmic Approach to Information and Meaning [PDF]
, 2011 I will survey some matters of relevance to a philosophical discussion of information, taking into account developments in algorithmic information theory (AIT).
Zenil, Hector
core +4 more sources
, 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
Replica Analysis and Approximate Message Passing Decoder for Superposition Codes
, 2014 Superposition codes are efficient for the Additive White Gaussian Noise channel. We provide here a replica analysis of the performances of these codes for large signals.
Barbier, Jean, Krzakala, Florent
core +1 more source
Isometry and Automorphisms of Constant Dimension Codes [PDF]
, 2012 We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are ...
Trautmann, Anna-Lena
core
Coded Caching for a Large Number Of Users
, 2016 Information theoretic analysis of a coded caching system is considered, in which a server with a database of N equal-size files, each F bits long, serves K users.
Amiri, Mohammad Mohammadi +2 more
core +1 more source
Hub structure in functional network of EEG signals supporting high cognitive functions in older individuals. [PDF]
Front Aging Neurosci, 2023 Tobe M +7 more
europepmc +1 more source