A Caltech Library Service

On Coding Over Sliced Information

Sima, Jin and Raviv, Netanel and Bruck, Jehoshua (2019) On Coding Over Sliced Information. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 767-771. ISBN 9781538692912.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes for this channel under substitution errors, and provide a code construction for a single substitution that is shown to be asymptotically optimal up to constants. The surprising result in this paper is that while the information vector is sliced into a set of unordered strings, the amount of redundant bits that are required to correct errors is orderwise equivalent to the amount required in the classical error correcting paradigm.

Item Type:Book Section
Related URLs:
URLURL TypeDescription Paper ItemTechnical Report ItemJournal Article
Sima, Jin0000-0003-4588-9790
Raviv, Netanel0000-0002-1686-1994
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2019 IEEE. The work was supported in part by NSF grants CCF-1816965 and CCF-1717884.
Funding AgencyGrant Number
Record Number:CaltechAUTHORS:20191004-100333511
Persistent URL:
Official Citation:J. Sima, N. Raviv and J. Bruck, "On Coding Over Sliced Information," 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 767-771. doi: 10.1109/ISIT.2019.8849596
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:99082
Deposited By: George Porter
Deposited On:04 Oct 2019 17:19
Last Modified:16 Nov 2021 17:43

Repository Staff Only: item control page