Back to Search
Start Over
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation.
- Source :
-
IEEE Transactions on Information Theory . Sep2021, Vol. 67 Issue 9, p5778-5790. 13p. - Publication Year :
- 2021
-
Abstract
- In this paper, we consider the list decoding property of codes under insertion and deletion errors (insdel for short). Firstly, we analyse the list decodability of random insdel codes. Our result provides a more complete picture on the list decodability of insdel codes when both insertion and deletion errors happen. Secondly, we construct a family of insdel codes along with their efficient encoding and decoding algorithms through concatenation method which provides a Zyablov-type bound for insdel metric codes. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INFORMATION theory
*BINARY codes
*DECODING algorithms
*ENCODING
*CYCLIC codes
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 67
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 153244919
- Full Text :
- https://doi.org/10.1109/TIT.2021.3096154