An improvement of the deletion channel capacity upper bound

Simple item page
dc.citation.epage1225en_US
dc.citation.spage1221en_US
dc.contributor.authorRahmati, M.en_US
dc.contributor.authorDuman, Tolga M.en_US
dc.coverage.spatialMonticello, IL, USA
dc.date.accessioned2016-02-08T12:09:59Z
dc.date.available2016-02-08T12:09:59Z
dc.date.issued2013-10en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 2-4 Oct. 2013
dc.descriptionConference name: 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013
dc.description.abstractIn 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:09:59Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1109/Allerton.2013.6736665en_US
dc.identifier.urihttp://hdl.handle.net/11693/28060
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/Allerton.2013.6736665en_US
dc.source.title51st Annual Allerton Conference on Communication, Control, and Computing, Allerton, 2013en_US
dc.subjectCommunicationen_US
dc.subjectDeletion channelsen_US
dc.subjectDeletion errorsen_US
dc.subjectEquivalent modelen_US
dc.subjectFragmentation processen_US
dc.subjectInput sequenceen_US
dc.subjectInput-outputen_US
dc.subjectOriginal channelsen_US
dc.subjectSubchannelsen_US
dc.subjectChannel capacityen_US
dc.titleAn improvement of the deletion channel capacity upper bounden_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An improvement of the deletion channel capacity upper bound.pdf
Size:
505.04 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Computer Engineering
Department of Electrical and Electronics Engineering