CUED Publications database

Coding for Segmented Edit Channels

Abroshan, M and Venkataramanan, R and Fabregas, AGI (2018) Coding for Segmented Edit Channels. IEEE Transactions on Information Theory, 64. pp. 3086-3098. ISSN 0018-9448

Full text not available from this repository.


© 1963-2012 IEEE. This paper considers 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 predetermined 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.

Item Type: Article
Uncontrolled Keywords: cs.IT cs.IT math.IT
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:58
Last Modified: 21 May 2019 03:02
DOI: 10.1109/TIT.2017.2788143