Related papers: Continuity of Channel Parameters and Operations un…
Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…
The design of time-independent local Hamiltonians that realise quantum algorithms is derived from the study of perfect state transfer. The novel features of this evolution are the perfect realisation of the computation, and the ability to…
We study the capacity region $C_L$ of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size $L$ and for the average error probability criterion. Motivated by known results…
We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been…
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…
Parameterizing mathematical models of biological systems often requires fitting to stable periodic data. In cardiac electrophysiology this typically requires converging to a stable action potential through long simulations. We explore this…
We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…
This paper studies the second-order asymptotics of the discrete memoryless multiple-access channel with degraded message sets. For a fixed average error probability $\epsilon\in(0,1)$ and an arbitrary point on the boundary of the capacity…
We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…
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…
Techniques from computational topology, in particular persistent homology, are becoming increasingly relevant for data analysis. Their stable metrics permit the use of many distance-based data analysis methods, such as multidimensional…
In this paper, the performance of decision directed (DD) maximum likelihood (ML) channel tracking algorithm is analyzed. The ML channel tracking algorithm presents efficient performance especially in the decision directed mode of the…
In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate…
This paper considers error probabilities of random codes for memoryless channels in the fixed-rate regime. Random coding is a fundamental scheme to achieve the channel capacity and many studies have been conducted for the asymptotics of the…
This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. Its main result is that, for a fixed BMS channel, the family…
We generalize the problem of controlling the interference created to an external observer while communicating over a discrete memoryless channel (DMC) which was studied in \cite{serrano:2014}. In particular, we consider the scenario where…
We investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R>C. The results are compared to the well-known properties of a channel coding…
We consider binary input deletion/substitution channels, which model certain types of synchronization errors encountered in practice. Specifically, we focus on the regime of small deletion and substitution probabilities, and by extending an…
Top-tier parallel computing clusters continue to accumulate more and more computational power with more and better CPUs and Networks. This allows, especially for environmental simulations, computations with larger domain sizes and better…