Now showing items 1-5 of 5

    • Bounds on the capacity of random insertion and deletion-additive noise channels 

      Rahmati, M.; Duman, T. M. (IEEE, 2013)
      We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information ...
    • Capacity bounds and concatenated codes over segmented deletion channels 

      Wang, F.; Duman, T. M.; Aktas, D. (IEEE, 2013)
      We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is ...
    • An improvement of the deletion channel capacity upper bound 

      Rahmati, M.; Duman, Tolga M. (IEEE, 2013-10)
      In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion channels by 'fragmenting' the input sequence where different subsequences travel through different ...
    • An upper bound on the capacity of non-binary deletion channels 

      Rahmati, M.; Duman, Tolga M. (IEEE, 2013)
      We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been ...
    • Upper bounds on the capacity of deletion channels using channel fragmentation 

      Rahmati, M.; Duman, T. M. (Institute of Electrical and Electronics Engineers Inc., 2015)
      We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. ...