Identification based on random coding
Information Theory
2022-07-08 v1 math.IT
Abstract
Ahlswede and Dueck showed possibility to identify with high probability one out of messages by transmitting bits only, where is the channel capacity. It is known that this identification can be based on error-correcting codes. We propose an identification procedure based on random codes that achieves channel capacity. Then we show that this procedure can be simplified using pseudo-random generators.
Cite
@article{arxiv.2207.03413,
title = {Identification based on random coding},
author = {Vladimir R. Sidorenko and Christian Deppe},
journal= {arXiv preprint arXiv:2207.03413},
year = {2022}
}