English
Related papers

Related papers: Strong Converse for Testing Against Independence o…

200 papers

Entanglement subject to noise can not be shielded against decaying. But, in case of many noisy channels, the degradation can be partially prevented by using local unitary operations. We consider the effect of local noise on shared quantum…

Quantum Physics · Physics 2025-02-05 Priya Ghosh , Kornikar Sen , Ujjwal Sen

The problem of signal detection using sparse, faint information is closely related to a variety of contemporary statistical problems, including the control of false-discovery rate, and classification using very high-dimensional data. Each…

Statistics Theory · Mathematics 2008-12-18 Peter Hall , Jiashun Jin

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

Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

A distributed inference scheme which uses bounded transmission functions over a Gaussian multiple access channel is considered. When the sensor measurements are decreasingly reliable as a function of the sensor index, the conditions on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-16 Sivaraman Dasarathan , Cihan Tepedelenlioglu

We study the spread of a quantum-mechanical wavepacket in a noisy environment, modeled using a tight-binding Hamiltonian. Despite the coherent dynamics, the fluctuating environment may give rise to diffusive behavior. When correlations…

Statistical Mechanics · Physics 2019-07-29 Nisarga Paul , Ariel Amir

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener

Deep learning with noisy labels is an interesting challenge in weakly supervised learning. Despite their significant learning capacity, CNNs have a tendency to overfit in the presence of samples with noisy labels. Alleviating this issue,…

Computer Vision and Pattern Recognition · Computer Science 2025-03-06 Yan Han , Soumava Kumar Roy , Mehrtash Harandi , Lars Petersson

This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes…

Information Theory · Computer Science 2018-11-21 Germán Bassi , Pablo Piantanida , Shlomo Shamai

This paper considers the comparison of noisy channels from the viewpoint of statistical decision theory. Various orderings are discussed, all formalizing the idea that one channel is "better" than another for information transmission. The…

Information Theory · Computer Science 2018-03-09 Francesco Buscemi

We exhibit a possible road towards a strong converse for the quantum capacity of degradable channels. In particular, we show that all degradable channels obey what we call a "pretty strong" converse: When the code rate increases above the…

Quantum Physics · Physics 2013-12-24 Ciara Morgan , Andreas Winter

An important aspect of multiple hypothesis testing is controlling the significance level, or the level of Type I error. When the test statistics are not independent it can be particularly challenging to deal with this problem, without…

Statistics Theory · Mathematics 2009-03-04 Sandy Clarke , Peter Hall

In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate $R$ is above channel capacity $C$, the error probability of decoding goes to one as the block length $n$ of code…

Information Theory · Computer Science 2012-05-03 Yasutada Oohama

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah

This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements…

Information Theory · Computer Science 2018-02-16 Eric Graves , Tan F. Wong

In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks…

Information Theory · Computer Science 2008-02-20 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here…

Quantum Physics · Physics 2017-01-03 Marco Tomamichel , Mark M. Wilde , Andreas Winter

Higher criticism is a method for detecting signals that are both sparse and weak. Although first proposed in cases where the noise variables are independent, higher criticism also has reasonable performance in settings where those variables…

Statistics Theory · Mathematics 2010-10-05 Peter Hall , Jiashun Jin

We consider the discrete memoryless degraded broadcast channels with feedback. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this…

Information Theory · Computer Science 2015-04-24 Yasutada Oohama

We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\epsilon > 0$ and privacy parameter $\delta > 0$ satisfy the…

Quantum Physics · Physics 2025-07-22 Zahra Baghali Khanian , Christoph Hirche
‹ Prev 1 3 4 5 6 7 10 Next ›