List decodability of symbol-pair codes
We investigate the list decodability of symbol-pair codes 1 in this paper. First, we show that the list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decode...
Saved in:
Main Authors: | Liu, Shu, Xing, Chaoping, Yuan, Chen |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/138021 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Griesmer bound and constructions of linear codes in b-symbol metric
由: Luo, Gaojun, et al.
出版: (2024) -
List decoding of cover metric codes up to the singleton bound
由: Liu, Shu, et al.
出版: (2020) -
A new class of rank-metric codes and their list decoding beyond the unique decoding radius
由: Xing, Chaoping, et al.
出版: (2020) -
Efficiently list-decodable insertion and deletion codes via concatenation
由: Liu, Shu, et al.
出版: (2022) -
A lower bound on the list-decodability of insdel codes
由: Liu, Shu, et al.
出版: (2023)