Coding for the ℓ-limited permutation channel

Michael Langberg, Moshe Schwartz, Eitan Yaakobi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In this work we consider the communication of information in the presence of synchronization errors. Specifically, we consider permutation channels in which a transmitted codeword x = (x1,⋯, xn) is corrupted by a permutation π ϵ Sn to yield the received word y = (y1,⋯, yn) where yi = xπ(i). We initiate the study of worst case (or zero error) communication over permutation channels that distort the information by applying permutations π which are limited to displacing any symbol by at most r locations, i.e. permutations π with weight at most r in the ℓ-metric. We present direct and recursive constructions, as well as bounds on the rate of such channels for binary and general alphabets. Specific attention is given to the case of r = 1.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781467377041
StatePublished - 28 Sep 2015
Externally publishedYes
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: 14 Jun 201519 Jun 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


ConferenceIEEE International Symposium on Information Theory, ISIT 2015
Country/TerritoryHong Kong
CityHong Kong

Bibliographical note

Publisher Copyright:
© 2015 IEEE.


Dive into the research topics of 'Coding for the ℓ-limited permutation channel'. Together they form a unique fingerprint.

Cite this