Achievable rates over insertion channels

Mojtaba Rahmati, Tolga M. Duman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We consider achievable rates over binary input insertion channels for small values of insertion probabilities by computing bounds on the mutual information rate of insertion channels for independent uniformly distributed (i.u.d.) input sequences. We consider two scenarios: random insertions, where transmitted bits are replaced with a certain probability by two random bits independent of any other insertions, and sticky channels where bits are duplicated with a certain probability again independent of the other insertion errors. Derived lower bounds improve the existing results available in the literature as demonstrated by specific examples.

Original languageEnglish (US)
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - Dec 1 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Rahmati, M., & Duman, T. M. (2011). Achievable rates over insertion channels. In 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011 [6134332] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2011.6134332