• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      An improvement of the deletion channel capacity upper bound

      Thumbnail
      View / Download
      505.0 Kb
      Author
      Rahmati, M.
      Duman, Tolga M.
      Date
      2013-10
      Source Title
      51st Annual Allerton Conference on Communication, Control, and Computing, Allerton, 2013
      Publisher
      IEEE
      Pages
      1221 - 1225
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      143
      views
      102
      downloads
      Abstract
      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 channels. The resulting output symbols are combined appropriately to come up with an equivalent input-output representation of the original channel which allows for derivation of new upper bounds on the channel capacity. Considering a random fragmentation processes applied to binary deletion channels, we prove an inequality relation among the capacities of the original binary deletion channel and the introduced binary deletion subchannels. This inequality enables us to provide an improved upper bound on the capacity of the i.i.d. deletion channels, i.e., C(d) ≤ 0.4143(1 - d) for d ≥ 0.65. We also consider a deterministic fragmentation process suitable for the study of non-binary deletion channels which results in improved capacity upper bounds. © 2013 IEEE.
      Keywords
      Communication
      Deletion channels
      Deletion errors
      Equivalent model
      Fragmentation process
      Input sequence
      Input-output
      Original channels
      Subchannels
      Channel capacity
      Permalink
      http://hdl.handle.net/11693/28060
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/Allerton.2013.6736665
      Collections
      • Department of Computer Engineering 1368
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy