English
Related papers

Related papers: New Channel Coding Lower Bounds for Noisy Permutat…

200 papers

This article characterizes new boundary points on the capacity region of certain classes of more capable broadcast channels (BC) with uni-directional cooperation from the stronger to the weaker receiver. The new boundary points are achieved…

Information Theory · Computer Science 2026-01-14 Nicolas Le Gouic , Yossef Steinberg , Michèle Wigger

We study error exponents for the problem of low-rate communication over a directed graph, where each edge in the graph represents a noisy communication channel, and there is a single source and destination. We derive maxflow-based…

Information Theory · Computer Science 2023-04-06 Yan Hao Ling , Jonathan Scarlett

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the…

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…

Quantum Physics · Physics 2021-10-26 Xin Wang

The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…

Information Theory · Computer Science 2010-11-22 Chao Tian , Suhas Diggavi , Shlomo Shamai

Conventional computers have evolved to device components that demonstrate failure rates of 1e-17 or less, while current quantum computing devices typically exhibit error rates of 1e-2 or greater. This raises concerns about the reliability…

Quantum Physics · Physics 2022-11-02 Samudra Dasgupta , Travis S. Humble

In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

A general quantum noisy channel is analyzed, wherein the transmitted qubits may experience symmetry-breaking decoherence, along with memory effects. We find the optimal basis not to be fully entangled, but a combination of factorized and…

Quantum Physics · Physics 2015-05-13 Goren Gordon , Gershon Kurizki

This paper provides novel insights into channel and subspace codes in nonadaptive channel sensing with a single RF chain. Observing that this problem naturally maps to a noncoherent decoding problem, we show that the sensing performance of…

Signal Processing · Electrical Eng. & Systems 2026-04-23 Parthasarathi Khirwadkar , Robin Rajamäki , Piya Pal

Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…

Information Theory · Computer Science 2009-04-22 David Tse , Roy Yates

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the…

Information Theory · Computer Science 2016-11-17 Mayur Agrawal , David Love , Venkataramanan Balakrishnan

This paper considers a discrete time-Poisson noise channel which is used to model pulse-amplitude modulated optical communication with a direct-detection receiver. The goal of this paper is to obtain insights into the capacity and the…

Information Theory · Computer Science 2021-11-23 Luca Barletta , Alex Dytso

Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…

Information Theory · Computer Science 2020-11-03 Jin-Yuan Wang , Xian-Tao Fu , Rong-Rong Lu , Jun-Bo Wang , Min Lin , Julian Cheng

This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our expansions employs a new quantity here called the channel…

Information Theory · Computer Science 2024-08-23 Recep Can Yavas , Victoria Kostina , Michelle Effros

We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…

Quantum Physics · Physics 2019-08-30 Chiara Macchiavello , Massimiliano F. Sacchi

We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…

Quantum Physics · Physics 2009-11-13 Michael M. Wolf , David Perez-Garcia

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined…

Information Theory · Computer Science 2008-10-07 Dario Fertonani , Tolga M. Duman
‹ Prev 1 3 4 5 6 7 10 Next ›