Title :
Insertion/deletion channels: reduced-state lower bounds on channel capacities
Author :
Kavcic, Aleksandar ; Motwani, Ravi
Author_Institution :
DEAS, Harvard Univ., Cambridge, MA, USA
fDate :
27 June-2 July 2004
Abstract :
We use Monte-Carlo methods to compute lower bounds on information rates of insertion/deletion channels. The information rate computation methods we propose are based on reduced-state trellis techniques. We compare the newly obtained bounds to some previously derived bounds (specifically for the deletion channel) and show that the new bounds are (much) sharper. In some regions, the new bound almost meets a known upper bound.
Keywords :
Monte Carlo methods; channel capacity; trellis codes; Monte-Carlo method; channel capacity; channel deletion; channel insertion; information rate computation method; reduced-state lower bound; reduced-state trellis technique; Channel capacity; Computational modeling; Entropy; Hidden Markov models; Information rates; Markov processes; Memory; Random variables; Statistics; Upper bound;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365266
