Capacity of Noisy Permutation Channels

10/31/2021
by   Jennifer Tang, et al.
0

We establish the capacity of a class of communication channels introduced in [1]. The n-letter input from a finite alphabet is passed through a discrete memoryless channel P_Z|X and then the output n-letter sequence is uniformly permuted. We show that the maximal communication rate (normalized by log n) equals 1/2 (rank(P_Z|X)-1) whenever P_Z|X is strictly positive. This is done by establishing a converse bound matching the achievability of [1]. The two main ingredients of our proof are (1) a sharp bound on the entropy of a uniformly sampled vector from a type class and observed through a DMC; and (2) the covering ϵ-net of a probability simplex with Kullback-Leibler divergence as a metric. In addition to strictly positive DMC we also find the noisy permutation capacity for q-ary erasure channels, the Z-channel and others.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2020

Coding Theorems for Noisy Permutation Channels

In this paper, we formally define and analyze the class of noisy permuta...
research
05/27/2019

On the Commitment Capacity of Unfair Noisy Channels

Noisy channels are a valuable resource from a cryptographic point of vie...
research
02/24/2021

It was "all" for "nothing": sharp phase transitions for noiseless discrete channels

We establish a phase transition known as the "all-or-nothing" phenomenon...
research
11/20/2020

On Error Exponents of Encoder-Assisted Communication Systems

We consider a point-to-point communication system, where in addition to ...
research
09/14/2023

Permutation Capacity Region of Adder Multiple-Access Channels

Point-to-point permutation channels are useful models of communication n...
research
10/25/2022

The capacity of a finite field matrix channel

The Additive-Multiplicative Matrix Channel (AMMC) was introduced by Silv...
research
09/03/2018

Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels

We consider discrete linear time invariant (LTI) channels satisfying the...

Please sign up or login with your details

Forgot password? Click here to reset