2017/01/12 by Ryo Yaguchi, Masahito Hayashi, Yaguchi, Ryo +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1701.03305
This paper and arXiv:1701.03290 address joint source-channel coding with markovian source. While arXiv:1701.03290 discusses the second order analysis, this paper discusses finite-length bounds as well as large and moderate deviation bounds. Hence, there is no overlap between these two papers
openalex publication_date 2017/01/12 · openalex created_date 2017/02/10 · arxiv created 2017/05/02 · arxiv updated 2017/05/03 · openalex updated_date 2026/07/28
We derive novel upper and lower finite-length bounds of the error probability in joint source-channel coding when the source obeys an ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. These bounds are tight in the large and moderate deviation regimes.