Show simple item record

dc.contributor.authorAbroshan, Maheden
dc.contributor.authorVenkataramanan, Ramjien
dc.contributor.authorFabregas, Albert Guillen Ien
dc.date.accessioned2018-01-15T10:11:25Z
dc.date.available2018-01-15T10:11:25Z
dc.date.issued2018en
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/270590
dc.description.abstractWe consider insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. No segment markers are available in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based on subsets of Varshamov-Tenengolts codes chosen with pre-determined prefixes and/or suffixes. The proposed codes, constructed for any finite alphabet, are zero-error and can be decoded segment-by-segment. We also derive an upper bound on the rate of any zero-error code for the segmented edit channel, in terms of the segment length. This upper bound shows that the rate scaling of the proposed codes as the segment length increases is the same as that of the maximal code.
dc.publisherIEEE
dc.titleCoding for Segmented Edit Channels.en
dc.typeArticle
prism.endingPage3098
prism.number4en
prism.publicationDate2018en
prism.publicationNameIEEE Trans. Inf. Theoryen
prism.startingPage3086
prism.volume64en
dc.identifier.doi10.17863/CAM.17507
dcterms.dateAccepted2017-12-01en
rioxxterms.versionAM*
rioxxterms.licenseref.urihttp://www.rioxx.net/licenses/all-rights-reserveden
rioxxterms.licenseref.startdate2018en
dc.contributor.orcidAbroshan, Mahed [0000-0002-0520-3953]
dc.contributor.orcidVenkataramanan, Ramji [0000-0001-7915-5432]
rioxxterms.typeJournal Article/Reviewen
pubs.funder-project-idEC FP7 ERC SIRG (259663)
pubs.funder-project-idEuropean Commission Horizon 2020 (H2020) ERC (725411)
rioxxterms.freetoread.startdate2018-12-29


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record