Capacity of noisy permutation channels
J Tang, Y Polyanskiy - IEEE Transactions on Information …, 2023 - ieeexplore.ieee.org
We establish the capacity of a class of communication channels introduced by Makur. The-
letter input from a finite alphabet is passed through a discrete memoryless channel and then …
letter input from a finite alphabet is passed through a discrete memoryless channel and then …
Efficient representation of large-alphabet probability distributions
A number of engineering and scientific problems require representing and manipulating
probability distributions over large alphabets, which we may think of as long vectors of reals …
probability distributions over large alphabets, which we may think of as long vectors of reals …
Minimax Regret on Patterns Using Kullback-Leibler Divergence Covering
J Tang - Conference on Learning Theory, 2022 - proceedings.mlr.press
This paper considers the problem of finding a tighter upper bound on the minimax regret of
patterns, a class used to study large-alphabet distributions which avoids infinite asymptotic …
patterns, a class used to study large-alphabet distributions which avoids infinite asymptotic …
Identification Over Binary Noisy Permutation Channels
We study message identification over the binary noisy permutation channel. For discrete
memoryless channels (DMCs), the number of identifiable messages grows doubly …
memoryless channels (DMCs), the number of identifiable messages grows doubly …
New Channel Coding Lower Bounds for Noisy Permutation Channels
L Feng, X Li, G Lv - arXiv preprint arXiv:2412.06497, 2024 - arxiv.org
Motivated by the application of point-to-point communication networks and biological
storage, we investigate new channel coding bounds for noisy permutation channels with …
storage, we investigate new channel coding bounds for noisy permutation channels with …
New Upper Bounds for Noisy Permutation Channels
L Feng, B Wang, G Lv, X Li, L Wang - arXiv preprint arXiv:2406.15031, 2024 - arxiv.org
The noisy permutation channel is a useful abstraction introduced by Makur for point-to-point
communication networks and biological storage. While the asymptotic capacity results exist …
communication networks and biological storage. While the asymptotic capacity results exist …
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander
A number of engineering and scientific problems require representing and manipulating
probability distributions over large alphabets, which we may think of as long vectors of reals …
probability distributions over large alphabets, which we may think of as long vectors of reals …