List Decodability of Symbol-Pair Codes

DOI10.1109/TIT.2019.2904998MaRDI QIDQ5224113zbMATH OpenOpenAlexWikidataFDO

Authors Shu Liu, Chaoping Xing, Chen Yuan

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.08992

zbMATH Keywords

Gilbert-Varshamov boundrandom symbol-pair coderandom symbol-pair code can be list decoded up to the Johnson-type bound

Mathematics Subject Classification ID

Decoding (94B35) Bounds on codes (94B65)

Abstract: We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that 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.

Cited in

(9)

• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• MDS symbol-pair codes from repeated-root cyclic codes
• Almost disjunctive list-decoding codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• List Decoding for Binary Goppa Codes
• scientific article; zbMATH DE number 5380293 (Why is no real title available?)
• List Decoding of Direct Sum Codes
• AMDS symbol-pair codes from repeated-root cyclic codes
• Several new classes of MDS symbol-pair codes

This page was built for publication: List Decodability of Symbol-Pair Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224113)