English
Related papers

Related papers: Hemispherical Concentration Subset Recovery in Man…

200 papers

Subcode-ensemble decoders improve iterative decoding by running multiple decoders in parallel over carefully chosen subcodes, increasing the likelihood that at least one decoder avoids the dominant trapping structures. Achieving strong…

Information Theory · Computer Science 2026-02-10 Yubeen Jo , Geon Choi , Chanho Park , Namyoon Lee

When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free…

Quantum Physics · Physics 2013-05-29 Chi-Kwong Li , Mikio Nakahara , Yiu-Tung Poon , Nung-Sing Sze , Hiroyuki Tomita

We consider the problem of clustering a graph $G$ into two communities by observing a subset of the vertex correlations. Specifically, we consider the inverse problem with observed variables $Y=B_G x \oplus Z$, where $B_G$ is the incidence…

Information Theory · Computer Science 2014-11-06 Emmanuel Abbe , Afonso S. Bandeira , Annina Bracher , Amit Singer

This paper considers a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may grow with the blocklength $n$. For this channel, it studies the…

Information Theory · Computer Science 2021-09-03 Jithin Ravi , Tobias Koch

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

We consider the problem of recovering a real-valued $n$-dimensional signal from $m$ phaseless, linear measurements and analyze the amplitude-based non-smooth least squares objective. We establish local convergence of subgradient descent…

Machine Learning · Computer Science 2021-08-31 Paul Hand , Oscar Leong , Vladislav Voroninski

In this paper, we tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, $x\in \mathbb{C}^n$, from the magnitudes of m linear measurements, $y=|Ax|$, where $A \in…

Information Theory · Computer Science 2015-02-18 Ramtin Pedarsani , Kangwook Lee , Kannan Ramchandran

Imaging reconstruction of interferometric data is a hard ill-posed inverse problem. Its difficulty is increased when observing the Galactic Center, which is obscured by a scattering screen. This is because the scattering breaks the…

Instrumentation and Methods for Astrophysics · Physics 2025-06-25 Alejandro Mus , Teresa Toscano , Hendrik Müller , Guang-Yao Zhao , Andrei Lobanov , Ciriaco Goddi

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

The past decade has seen notable advances in our understanding of structured error-correcting codes, particularly binary Reed--Muller (RM) codes. While initial breakthroughs were for erasure channels based on symmetry, extending these…

Information Theory · Computer Science 2025-04-23 Henry D. Pfister , Galen Reeves

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…

Information Theory · Computer Science 2014-09-09 Mohammad Javad Emadi , Majid Nasiri Khormuji , Mikael Skoglund , Mohammad Reza Aref

Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the…

Information Theory · Computer Science 2008-05-14 Saurabha Tavildar , Pramod Viswanath , Aaron B. Wagner

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

We consider a monitoring application where sensors periodically report data to a common receiver in a time division multiplex fashion. The sensors are constrained by the limited and unpredictable energy availability provided by Energy…

Information Theory · Computer Science 2017-06-29 Chiara Pielli , Cedomir Stefanovic , Petar Popovski , Michele Zorzi

In the problem of one-bit compressed sensing, the goal is to find a $\delta$-close estimation of a $k$-sparse vector $x \in \mathbb{R}^n$ given the signs of the entries of $y = \Phi x$, where $\Phi$ is called the measurement matrix. For the…

Information Theory · Computer Science 2016-09-22 Vasileios Nakos

Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…

Quantum Physics · Physics 2013-07-12 Mark M. Wilde

In recent years, reversible data hiding has attracted much more attention than before. Reversibility signifies that the original media can be recovered without any loss from the marked media after extracting the embedded message. This paper…

Cryptography and Security · Computer Science 2011-02-09 Xu-Ren Luo , Chen-Hui Jerry Lin , Te-Lung Yin

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing…

Quantum Physics · Physics 2018-02-07 David K. Tuckett , Stephen D. Bartlett , Steven T. Flammia
‹ Prev 1 8 9 10 Next ›