Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908557104906240 |
|---|---|
| author | Oohama, Yasutada |
| author_facet | Oohama, Yasutada |
| contents | We consider the stationaly memoryless channels with input cost. We prove that for transmission rates above the capacity the correct probability of decoding tends to zero exponentially as the block length $n$ of codes tends to infinity. In the case where both of channel input and output sets are finite, we determine the optimal exponent function on the above exponential decay of the correct probability. To derive this result we use a new technique called the recuresive method, which is based on the information spectrum approach. The recursive method utilize a certain recursive structure on the information spectrum quantities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1701_06545 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity Oohama, Yasutada Information Theory We consider the stationaly memoryless channels with input cost. We prove that for transmission rates above the capacity the correct probability of decoding tends to zero exponentially as the block length $n$ of codes tends to infinity. In the case where both of channel input and output sets are finite, we determine the optimal exponent function on the above exponential decay of the correct probability. To derive this result we use a new technique called the recuresive method, which is based on the information spectrum approach. The recursive method utilize a certain recursive structure on the information spectrum quantities. |
| title | Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity |
| topic | Information Theory |
| url | https://arxiv.org/abs/1701.06545 |