Coding for the permutation channel with insertions, deletions, substitutions, and erasures

Abstract

This paper is motivated by the error-control problem in communication channels in which the transmitted sequences are subjected to random permutations, in addition to being impaired with insertions, deletions, substitutions, and erasures of symbols. Bounds on the size of optimal codes in this setting are derived, and their asymptotic behavior examined in… (More)
DOI: 10.1109/ISIT.2017.8006866

4 Figures and Tables

Topics

  • Presentations referencing similar topics