相关论文: Conditional Entropies of k-Deletion/Insertion Chan…

In classical information theory, a causal relationship between two variables is typically modelled by assuming that, for every possible state of one of the variables, there exists a particular distribution of states of the second variable.…

Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…

We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is…

The effective diffusivity of Brownian tracer particles confined in periodic micro-channels is smaller than the microscopic diffusivity due to entropic trapping. Here, we study diffusion in two-dimensional periodic channels whose…

For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…

Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with respect to the size of the domain. Thus, support for higher-order…

A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the…

In this paper we obtain new bounds for the minimum output entropies of random quantum channels. These bounds rely on random matrix techniques arising from free probability theory. We then revisit the counterexamples developed by Hayden and…

The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…

It is known that random quantum channels exhibit significant violations of multiplicativity of maximum output p-norms for any p>1. In this work, we show that a weaker variant of multiplicativity nevertheless holds for these channels. For…

This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…

We investigate the Weyl channels being covariant with respect to the maximum commutative group of unitary operators. This class includes the quantum depolarizing channel and the "two-Pauli" channel as well. Then, we show that our estimation…

We study the regularized average Renyi output entropy $\bar{S}_{r}^{\reg}$ of quantum channels. This quantity gives information about the average noisiness of the channel output arising from a typical, highly entangled input state in the…

Subword tokenization is a key part of many NLP pipelines. However, little is known about why some tokenizer and hyperparameter combinations lead to better downstream model performance than others. We propose that good tokenizers lead to…

We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assume that the sync pattern of length N starts being emitted at…

We introduce a new form for the bosonic channel minimal output entropy conjecture, namely that among states with equal input entropy, the thermal states are the ones that have slightest increase in entropy when sent through a infinitesimal…

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the…

We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose(PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing…

We investigate minimum output (R\'enyi) entropy of qubit channels and unital quantum channels. We obtain an exact formula for the minimum output entropy of qubit channels, and bounds for unital quantum channels. Interestingly, our bounds…