Now showing items 1-4 of 4

    • 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 ...
    • Multi-input multi-output deletion channel 

      Wang F.; Duman, T. M. (Institute of Electrical and Electronics Engineers, 2012)
      We describe a new channel model suitable in certain applications, namely the multi-input multi-output (MIMO) deletion channel. This channel models the scenarios where multiple transmitters and receivers suffering from ...
    • 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. ...