English
Related papers

Related papers: Improved bounds on the interactive capacity via er…

200 papers

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

We establish empirical risk minimization principles for active learning by deriving a family of upper bounds on the generalization error. Aligning with empirical observations, the bounds suggest that superior query algorithms can be…

Machine Learning · Statistics 2024-09-17 Vincent Menden , Yahya Saleh , Armin Iske

We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of the fragments. Such a channel is motivated by applications…

Information Theory · Computer Science 2024-07-09 Aditya Narayan Ravi , Alireza Vahid , Ilan Shomorony

The input-constrained binary erasure channel (BEC) with strictly causal feedback is studied. The channel input sequence must satisfy the $(0,k)$-runlength limited (RLL) constraint, i.e., no more than $k$ consecutive `$0$'s are allowed. The…

Information Theory · Computer Science 2017-12-08 Ori Peled , Oron Sabag , Haim H. Permuter

In this paper, we consider the effect of feedback channel error on the throughput of one-hop wireless networks under the random connection model. The transmission strategy is based on activating source-destination pairs with strongest…

Information Theory · Computer Science 2013-08-13 Seyed Pooya Shariatpanahi , Hamed Shah-Mansouri , Babak Hossein Khalaj

We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be…

Information Theory · Computer Science 2012-08-02 Ahmed Badr , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEARCH and SORT functions from noisy pairwise comparisons. For…

Data Structures and Algorithms · Computer Science 2023-06-22 Banghua Zhu , Ziao Wang , Nadim Ghaddar , Jiantao Jiao , Lele Wang

One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…

Information Theory · Computer Science 2013-02-08 Reza K. Farsani

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

We consider data transmission over a network where each edge is an erasure channel and where the inner nodes transmit a random linear combination of their incoming information. We distinguish two channel models in this setting, the row and…

Information Theory · Computer Science 2017-10-18 Heide Gluesing-Luerssen , Anna-Lena Horlemann-Trautmann

One of the main figures of merit for quantum memories and quantum communication devices is their quantum capacity. It has been studied for arbitrary kinds of quantum channels, but its practical estimation has so far been limited to devices…

Quantum Physics · Physics 2018-05-16 Corsin Pfister , M. Adriaan Rol , Atul Mantri , Marco Tomamichel , Stephanie Wehner

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

Learning with label dependent label noise has been extensively explored in both theory and practice; however, dealing with instance (i.e., feature) and label dependent label noise continues to be a challenging task. The difficulty arises…

Machine Learning · Statistics 2023-06-07 Hyungki Im , Paul Grigas

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information…

Information Theory · Computer Science 2007-07-16 Nandakishore Santhi , Alexander Vardy

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…

Information Theory · Computer Science 2025-10-30 Hadi Aghaee , Christian Deppe , Holger Boche

Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel…

Information Theory · Computer Science 2013-10-16 Behrooz Makki , Alexandre Graell i Amat , Thomas Eriksson

Quantum error mitigation is a promising route to achieving quantum utility, and potentially quantum advantage in the near-term. Many state-of-the-art error mitigation schemes use knowledge of the errors in the quantum processor, which opens…

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…

Information Theory · Computer Science 2016-11-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

For a physical layer message authentication procedure based on the comparison of channel estimates obtained from the received messages, we focus on an outer bound on the type I/II error probability region. Channel estimates are modelled as…

Information Theory · Computer Science 2016-10-05 Augusto Ferrante , Nicola Laurenti , Chiara Masiero , Michele Pavon , Stefano Tomasin

We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays central role in a variety of communications/processing problems.…

Information Theory · Computer Science 2014-03-25 Wasim Huleihel , Neri Merhav , Shlomo Shamai
‹ Prev 1 8 9 10 Next ›