Codes for channels with segmented edits
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Abroshan, Mahed https://orcid.org/0000-0002-0520-3953
Venkataramanan, Ramji https://orcid.org/0000-0001-7915-5432
Guillen i Fabregas, Albert https://orcid.org/0000-0003-2795-1124
Abstract
We 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. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based on subsets of VT codes chosen with pre-determined prefixes and/or suffixes. The proposed codes are zero-error, can be decoded segment-by-segment, and their rate scaling as the segment length increases is the same as that of the maximal code.
Description
Keywords
Deletion channels, insertion channels, Varshamov-Tenegolts codes, zero-error codes
Journal Title
IEEE Transactions on Information Theory
Conference Name
Journal ISSN
0018-9448
1557-9654
1557-9654
Volume Title
64
Publisher
IEEE
Publisher DOI
Sponsorship
European Research Council (259663)
European Research Council (725411)
European Research Council (725411)
This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.