1 problem

0 votes0 replies0 views
A lower-bound conjecture for asymmetric and singular channels
Let $W$ be an asymmetric or singular discrete memoryless channel with input alphabet ${\cal X}$ and output alphabet ${\cal Y}$ . For rate $R$ , let $\bar{P}_{\mathrm{e},c}(n,R)$ deno…
Conjectureopenchannel-coding information-theory sphere-packing-exponentarXiv posted 2 days ago

A lower-bound conjecture for asymmetric and singular channels