TY - GEN
T1 - Achievable rates over insertion channels
AU - Rahmati, Mojtaba
AU - Duman, Tolga M.
PY - 2011/12/1
Y1 - 2011/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84857222520&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84857222520&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6134332
DO - 10.1109/GLOCOM.2011.6134332
M3 - Conference contribution
AN - SCOPUS:84857222520
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -