Channel Resolvability Using Multiplicative Weight Update Algorithm
arXiv:2501.11881
Abstract
We study the channel resolvability problem, which is used to prove strong converse of identification via channel. Channel resolvability has been solved by only random coding in the literature. We prove channel resolvability using the multiplicative weight update algorithm. This is the first approach to channel resolvability using non-random coding.
8 pages. Version 2 is for correcting typo. Version 3 improved presentation. Version 4 corrects a minor error in the proof of Theorem 10; the result itself is unaffected