English
Related papers

Related papers: Identification for Inverse Gaussian Channels

200 papers

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

Sending quantum information reliably over long distances is a central challenge in quantum technology in general, and in quantum optics in particular, since most quantum communication relies on optical fibres or free-space links. Here, we…

Quantum Physics · Physics 2026-02-27 Tobias Rippchen , Ludovico Lami , Gerardo Adesso , Mario Berta

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2023-05-17 Antonino Favano , Luca Barletta , Alex Dytso

As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy:…

Quantum Physics · Physics 2013-02-05 Graeme Smith , John A. Smolin , Jon Yard

This paper considers the problem of closed-loop identification of linear scalar systems with Gaussian process noise, where the system input is determined by a deterministic state feedback policy. The regularized least-square estimate (LSE)…

Systems and Control · Electrical Eng. & Systems 2020-03-30 Ali Reza Pedram , Takashi Tanaka

For memoryless channels with continuous input alphabets, deterministic identification (DI) typically exhibits a linearithmic ($n\log n$) message growth. However, the exact DI capacity has long remained open due to a persistent gap between…

Information Theory · Computer Science 2026-05-07 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the…

Information Theory · Computer Science 2017-02-07 Yasutada Oohama

In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a…

Information Theory · Computer Science 2011-11-23 Arya Mazumdar , Alexander Barg , Navin Kashyap

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random…

Information Theory · Computer Science 2016-11-15 Nariman Farsad , Yonathan Murin , Andrew Eckford , Andrea Goldsmith

We study the second-order asymptotics of information transmission using random Gaussian codebooks and nearest neighbor (NN) decoding over a power-limited stationary memoryless additive non-Gaussian noise channel. We show that the dispersion…

Information Theory · Computer Science 2016-10-20 Jonathan Scarlett , Vincent Y. F. Tan , Giuseppe Durisi

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

Driven by the demands of high-frequency wireless communications in 5G and 6G systems (e.g., mmWave, sub-THz), we explore a state-dependent {\em Gaussian beam-pointing} (GBP) channel. In this model, the channel state defines an unknown angle…

Information Theory · Computer Science 2025-08-29 Siyao Li , Shuangyang Li , Giuseppe Caire

The goal of this paper is two-fold. First, to establish a tractable model for the underwater acoustic channel useful for network optimization in terms of convexity. Second, to propose a network coding based lower bound for transmission…

Information Theory · Computer Science 2008-09-02 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite…

Information Theory · Computer Science 2025-03-28 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The…

Information Theory · Computer Science 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy

We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise…

Quantum Physics · Physics 2015-03-17 Joachim Schäfer , Evgueni Karpov , Nicolas J. Cerf

Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…

Quantum Physics · Physics 2012-07-06 Patrick Hayden , Peter W. Shor , Andreas Winter

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

This paper considers the cognitive interference channel (CIC) with two transmitters and two receivers, in which the cognitive transmitter non-causally knows the message and codeword of the primary transmitter. We first introduce a discrete…

Information Theory · Computer Science 2011-02-08 Mojtaba Vaezi , Mai Vu