Identification capacity of the q-ary noisy permutation channel is (q-1)/2 for full-rank strictly positive noise, with matching achievability and strong converse up to log factors.
Coding theorems for noisy permutation channels.IEEE Transactions on Information Theory, 66(11):6723–6748, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Identification Over Noisy Permutation Channels
Identification capacity of the q-ary noisy permutation channel is (q-1)/2 for full-rank strictly positive noise, with matching achievability and strong converse up to log factors.