This website requires JavaScript.

Shannon Capacity of Channels with Markov Insertions, Deletions and Substitutions

Ruslan MorozovTolga M. Duman
Jan 2024
0被引用
0笔记
摘要原文
We consider channels with synchronization errors modeled as insertions and deletions. A classical result for such channels is the information stability of such channels, hence the existence of the Shannon capacity, when the synchronization errors are memoryless. In this paper, we extend this result to the case where the insertions and deletions have memory. Specifically, we assume that the synchronization errors are governed by a stationary and ergodic finite state Markov chain, and prove that mutual information capacity of such channels exist, and it is equal to its coding capacity, showing that there exists a coding scheme which achieves this limit.
展开全部
机器翻译
AI理解论文&经典十问
图表提取
参考文献
发布时间 · 被引用数 · 默认排序
被引用
发布时间 · 被引用数 · 默认排序
社区问答