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 |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138021 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
A space-time block code using orthogonal frequency-shift-keying
by: Ho, P., et al.
Published: (2014)
by: Ho, P., et al.
Published: (2014)
Similar Items
-
Griesmer bound and constructions of linear codes in b-symbol metric
by: Luo, Gaojun, et al.
Published: (2024) -
List decoding of cover metric codes up to the singleton bound
by: Liu, Shu, et al.
Published: (2020) -
A new class of rank-metric codes and their list decoding beyond the unique decoding radius
by: Xing, Chaoping, et al.
Published: (2020) -
Efficiently list-decodable insertion and deletion codes via concatenation
by: Liu, Shu, et al.
Published: (2022) -
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023)