Channel Resolvability Using Multiplicative Weight Update Algorithm

TL;DR

This paper introduces a novel non-random coding method for channel resolvability using the multiplicative weight update algorithm, providing an alternative approach to the traditional random coding techniques.

Contribution

It is the first to apply the multiplicative weight update algorithm to solve the channel resolvability problem.

Findings

First non-random coding proof of channel resolvability

Demonstrates effectiveness of multiplicative weight update algorithm in information theory

Provides new insights into channel resolvability techniques

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.