List Decodability of Symbol-Pair Codes
From MaRDI portal
Publication:5224113
DOI10.1109/TIT.2019.2904998zbMath1432.94201arXiv1806.08992OpenAlexW2886029493WikidataQ128255722 ScholiaQ128255722MaRDI QIDQ5224113
Chen Yuan, Shu Liu, Xing, Chaoping
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
Gilbert-Varshamov boundrandom symbol-pair coderandom symbol-pair code can be list decoded up to the Johnson-type bound
Related Items (4)
Constructions of MDS symbol-pair codes with minimum distance seven or eight ⋮ AMDS symbol-pair codes from repeated-root cyclic codes ⋮ On symbol-pair weight distribution of MDS codes and simplex codes over finite fields ⋮ MDS symbol-pair codes from repeated-root cyclic codes
This page was built for publication: List Decodability of Symbol-Pair Codes