Conference
Coding for the $\ell_{\infty}$-Limited Permutation Channel
Abstract
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=(x_{1},\ \ldots, x_{n})$ is corrupted by a permutation $\pi\in \mathrm{S}_{n}$ to yield the received word $y=(y_{1},\ \ldots y_{n})$ where $y_{j}=x_{\pi(i}$. We initiate the study of worst case (or zero error) communication over permutation channels that distort …
Authors
Langberg M; Schwartz M; Yaakobi E
Pagination
pp. 1936-1940
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
June 1, 2015
DOI
10.1109/isit.2015.7282793
Name of conference
2015 IEEE International Symposium on Information Theory (ISIT)