Codes for channels with segmented edits
IEEE Transactions on Information Theory
MetadataShow full item record
Abroshan, M., Venkataramanan, R., & Guillen i Fabregas, A. (2018). Codes for channels with segmented edits. IEEE Transactions on Information Theory, 64 (4), 3086-3098. https://doi.org/10.1109/TIT.2017.2788143
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.
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.
EC FP7 ERC SIRG (259663)
European Commission Horizon 2020 (H2020) ERC (725411)
External DOI: https://doi.org/10.1109/TIT.2017.2788143
This record's URL: https://www.repository.cam.ac.uk/handle/1810/264683