A Caltech Library Service

On Coding over Sliced Information

Sima, Jin and Raviv, Netanel and Bruck, Jehoshua (2018) On Coding over Sliced Information. Parallel and Distributed Systems Group Technical Reports, 143. California Institute of Technology , Pasadena, CA. (Submitted)

[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 several constructions, some of which are shown to be asymptotically optimal. 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 asymptotically equal to the amount required in the classical error correcting paradigm.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription Report ItemConference Paper ItemJournal Article
Sima, Jin0000-0003-4588-9790
Raviv, Netanel0000-0002-1686-1994
Bruck, Jehoshua0000-0001-8474-0812
Group:Parallel and Distributed Systems Group
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Series Name:Parallel and Distributed Systems Group Technical Reports
Issue or Number:143
Record Number:CaltechAUTHORS:20181002-162910265
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:90087
Deposited By: George Porter
Deposited On:05 Oct 2018 21:33
Last Modified:15 Mar 2021 17:36

Repository Staff Only: item control page