2019-03-14
List decodability of symbol-pair codes
Publication
Publication
IEEE Transactions on Information Theory , Volume 65 - Issue 8 p. 4815- 4821
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 decoded up to the Gilbert-Varshamov bound. Our second result of this paper is to derive the Johnson-type bound, i.e., a lower bound on list decoding radius in terms of minimum distance. Finally, we present a list decoding algorithm of Reed-Solomon codes beyond the Johnson-type bound in the pair metric. 1
A symbol-pair code is referred to a code is the pair metric.
| Additional Metadata | |
|---|---|
| , , | |
| doi.org/10.1109/TIT.2019.2904998 | |
| IEEE Transactions on Information Theory | |
| Organisation | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
|
Liu, S., Xing, C., & Yuan, C. (2019). List decodability of symbol-pair codes. IEEE Transactions on Information Theory, 65(8), 4815–4821. doi:10.1109/TIT.2019.2904998 |
|
