References & Citations
Computer Science > Information Theory
Title: Shannon Capacity of Channels with Markov Insertions, Deletions and Substitutions
(Submitted on 29 Jan 2024 (this version), latest version 26 Mar 2024 (v3))
Abstract: 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.
Submission history
From: Ruslan Morozov [view email][v1] Mon, 29 Jan 2024 11:18:29 GMT (27kb)
[v2] Tue, 30 Jan 2024 10:44:21 GMT (27kb)
[v3] Tue, 26 Mar 2024 18:57:17 GMT (26kb)
Link back to: arXiv, form interface, contact.