Finite BSC-Decomposition of Binary-Input Symmetric-Output Channels and Applications to Channel Simulation
Overview & Synopsis
We propose a finite BSC-decomposition method for representing an arbitrary binary-input symmetric-output channel (BISOC) as a mixture of binary symmetric channels (BSCs) with at most $\ell+1$ distinct crossover probabilities. We show that the weighted average capacity of the component BSCs exceeds the capacity of the original BISOC by at most $(ฯ^2\log e)/(48\ell^2)+O(\ell^{-5/2})$ bits, and the leading term is asymptotically optimal in the worst case. Based on the finite BSC-decomposition, we design a channel simulation scheme for arbitrary BISOCs. Combined with efficient channel simulation algorithms for BSCs, our scheme achieves a communication rate with $O((\log n / n)^{2/3})$ redundancy over the capacity for simulating $n$ copies of a BISOC.
arxiv.org)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Finite BSC-Decomposition of Binary-Input Symmetric-Output Channels and Applications to Channel Simulation |
|---|---|
| Author / Organization | Jianguo Zhao, Cheuk Ting Li |
| Subject & Discipline | cs.IT |
| Categories | Science & Mathematics |
| Publication Year | 2026 |
| License / Rights | arXiv Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
arXiv
(arxiv.org)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-274136 |
| Original Source Link | Visit Source Page on arxiv.org » |