A Derivation of the source-channel error exponent using nonidentical product distributions
This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For...
| Authors: | , , , , |
|---|---|
| Format: | article |
| Status: | Versión aceptada para publicación |
| Publication Date: | 2014 |
| Country: | España |
| Institution: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repository: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10230/36003 |
| Online Access: | http://hdl.handle.net/10230/36003 http://dx.doi.org/10.1109/TIT.2014.2315818 |
| Access Level: | Open access |
| Keyword: | Error probability Channel coding Reliability Upper bound Probability distribution Joints |
| Summary: | This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight. |
|---|