Year: 2024
Type: conference-paper
Abstract: We consider the redundancy of the exact channel synthesis problem under an i.i.d. assumption. Existing results provide an upper bound on the unnormalized redundancy that is logarithmic in the block length. We show, via an improved scheme, that the logarithmic term can be halved for most channels and eliminated for all others. For full-support discrete memory less channels, we show that this is the best possible.
Authors: Sharang M. Sriramu, Aaron B. Wagner
Institution: Cornell University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4401692006