Published May 2021
| public
Journal Article
On Coding over Sliced Information
- Creators
-
Sima, Jin
-
Raviv, Netanel
-
Bruck, Jehoshua
Abstract
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 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 order-wise equivalent to the amount required in the classical error correcting paradigm.
Additional Information
© 2021 IEEE. Manuscript received October 26, 2019; revised December 9, 2020; accepted January 10, 2021. Date of publication March 4, 2021; date of current version April 21, 2021. This work was supported in part by NSF under Grant CCF-1816965 and Grant CCF-1717884. The work of Netanel Raviv was supported in part by the Postdoctoral Fellowship of the Center for the Mathematics of Information (CMI), Caltech, and in part by the Lester-Deutsch Postdoctoral Fellowship. This article was presented at the 2019 IEEE International Symposium on Information Theory.Additional details
- Eprint ID
- 108427
- Resolver ID
- CaltechAUTHORS:20210315-103437288
- CCF-1816965
- NSF
- CCF-1717884
- NSF
- Center for the Mathematics of Information, Caltech
- Lester-Deutsch Postdoctoral Fellowship
- Created
-
2021-03-19Created from EPrint's datestamp field
- Updated
-
2021-04-23Created from EPrint's last_modified field