Related papers: The Power of Priority Channel Systems
We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…
One of the major achievements of the recently emerged quantum information theory is the introduction and thorough investigation of the notion of quantum channel which is a basic building block of any data-transmitting or data-processing…
We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…
Channel prediction permits to acquire channel state information (CSI) without signaling overhead. However, almost all existing channel prediction methods necessitate the deployment of a dedicated model to accommodate a specific…
Channel estimation is a critical task in multiple-input multiple-output (MIMO) digital communications that substantially effects end-to-end system performance. In this work, we introduce a novel approach for channel estimation using deep…
The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of…
Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…
We claim that networks are created according to the priority attachment mechanism and we show a simple model which uses the priority attachment to generate both synthetic and close to empirical networks. Priority attachment is a mechanism…
In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer.…
In modern networks, forwarding of packets often depends on the history of previously transmitted traffic. Such networks contain stateful middleboxes, whose forwarding behaviour depends on a mutable internal state. Firewalls and load…
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…
This paper examines the maximum code rate achievable by a data-driven communication system over some unknown discrete memoryless channel in the finite blocklength regime. A class of channel codes, called learning-based channel codes, is…
Message delivery respecting causal ordering (causal delivery) is one of the most classic and widely useful abstraction for inter-process communication in a distributed system. Most approaches tag messages with causality information and…
Completely depolarising channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels…
In wireless communication-based formation control systems, the control performance is significantly impacted by the channel capacity of each communication link between agents. This relationship, however, remains under-investigated in the…
The problem of dephasing channel discrimination is addressed for finite-dimensional systems. In particular, the optimization with respect to input states without energy constraint is solved analytically for qubit, qutrit and ququart.…
We investigate state estimation of linear systems over channels having a finite state not known by the transmitter or receiver. We show that similar to memoryless channels, zero-error capacity is the right figure of merit for achieving…
A deep understanding of the queuing performance of wireless networks is essential for the advancement of future wireless communications. The stochastic nature of wireless channels in general gives rise to a time varying transmission rate.…
In this paper, the secure transmission of information over an ergodic fading channel is investigated in the presence of statistical quality of service (QoS) constraints. We employ effective capacity, which provides the maximum constant…
A new stochastic order between two fading distributions is introduced. A fading channel dominates another in the ergodic capacity ordering sense, if the Shannon transform of the first is greater than that of the second at all values of…