Markov Insertion/Deletion Channels: Information Stability and Capacity Bounds
Abstract: We consider channels with synchronization errors modeled as insertions and deletions. A classical result for such channels is their information stability, 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 such channel is information-stable, which implies the existence of a coding scheme which achieves the limit of mutual information. This result implies the existence of the Shannon capacity for a wide range of channels with synchronization errors, with different applications including DNA storage. The methods developed may also be useful to prove other coding theorems for non-trivial channel sequences.
- C. Shannon, “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, pp. 379–423, 623–656, July, October 1948.
- R. L. Dobrushin, “A general formulation of the fundamental theorem of Shannon in the theory of information,” Uspekhi Mat. Nauk, vol. 14, no. 6, pp. 3–104, 1959.
- ——, “Shannon’s theorems for channels with synchronization errors,” Problems of Information Transmission, vol. 3, no. 4, pp. 18–36, 1967.
- S. Z. Stambler, “Memoryless channels with synchronization errors: the general case,” Probl. Peredachi Inf., vol. 6, no. 3, pp. 43–49, 1970.
- M. Mushkin and I. Bar-David, “Capacity and coding for the Gilbert-Elliott channels,” IEEE Transactions on Information Theory, vol. 35, no. 6, pp. 1277–1290, 1989.
- Y. Li and V. Y. F. Tan, “On the capacity of channels with deletions and states,” IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2663–2679, 2021.
- J. Hu, T. M. Duman, K. E. M., and E. M. F., “Bit patterned media with written-in errors: Modelling, detection and theoretical limits,” IEEE Transactions on Magnetics, vol. 43, pp. 3517–3524, 2007.
- I. Shomorony and R. Heckel, “DNA-based storage: Models and fundamental limits,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3675–3689, 2021.
- D. Fertonani and T. M. Duman, “Novel bounds on the capacity of binary deletion channels,” IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2753–2765, 2010.
- D. Fertonani, T. M. Duman, and M. F. Erden, “Upper bounds on the capacity of deletion channels using channel fragmentation,” IEEE Transactions on Communications, vol. 59, no. 1, pp. 2–6, 2011.
- E. Drinea and M. Mitzenmacher, “On lower bounds for the capacity of deletion channels,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4648–4657, 2006.
- Y. Kanoria and A. Montanari, “Optimal coding for the binary deletion channel with small deletion probability,” IEEE Transactions on Information Theory, vol. 59, no. 10, pp. 6192–6219, 2013.
- M. Mitzenmacher, “A survey of results for deletion channels and related synchronization channels,” Probability Surveys, vol. 6, pp. 1–33, 2009.
- M. Cheraghchi and J. Ribeiro, “An overview of capacity results for synchronization channels,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3207–3232, 2021.
- L. Deng, Y. Wang, M. Noor-A-Rahim, Y. L. Guan, Z. Shi, E. Gunawan, and C. L. Poh, “Optimized code design for constrained DNA data storage with asymmetric errors,” IEEE Access, vol. 7, pp. 84 107–84 121, 2019.
- B. Hamoum and E. Dupraz, “Channel model and decoder with memory for DNA data storage with nanopore sequencing,” IEEE Access, vol. 11, pp. 52 075–52 087, 2023.
- S. Verdu and T. S. Han, “A general formula for channel capacity,” IEEE Transactions on Information Theory, vol. 40, no. 4, pp. 1147–1157, 1994.
- N. Bruijn, de and P. Erdös, “Some linear and some quadratic recursion formulas. II,” Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen: Series A: Mathematical Sciences, vol. 14, pp. 152–163, 1952.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.