2025/01/21 by Shun Watanabe, Takahashi, Koki, Watanabe, Shun
Computer Science · Engineering · #Advanced Wireless Communication Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #PAPR reduction in OFDM #Wireless Communication Networks Research
paper · pdf · doi:10.48550/arxiv.2501.11881
openalex publication_date 2025/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.