Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/145458
Title: List decoding of cover metric codes up to the singleton bound
Authors: Liu, Shu
Xing, Chaoping
Yuan, Chen
Keywords: Engineering::Computer science and engineering
Issue Date: 2018
Source: Liu, S., Xing, C., & Yuan, C. (2018). List decoding of cover metric codes up to the singleton bound. IEEE Transactions on Information Theory, 64(4), 2410-2416. doi:10.1109/TIT.2018.2801340
Journal: IEEE Transactions on Information Theory
Abstract: Wachter-Zeh showed that every cover metric code can be list decoded up to the Johnson-like bound. Furthermore, it was shown that the efficient list decoding of cover metric codes up to the Johnson-like bound can be performed. From the work of Wachter-Zeh, one natural question is whether the Johnson-like bound can be improved. In this paper, we give a confirmative answer to this question by showing that the cover metric codes can be list decoded up to the Singleton bound. Our contributions consist of three parts. First, we prove that the list decodability of cover metric codes does not exceed the Singleton bound. Second, we show that, with high probability, a random cover metric code can be list decoded up to the Singleton bound, which is better than the Johnson-like bound. Third, by applying the existing decoding algorithms for Hamming metric and rank metric codes, we present explicit constructions of cover metric codes that can be efficiently list decoded up to the Singleton bound.
URI: https://hdl.handle.net/10356/145458
ISSN: 1557-9654
DOI: 10.1109/TIT.2018.2801340
Rights: © 2018 Institute of Electrical and Electronics Engineers (IEEE). All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SPMS Journal Articles

SCOPUSTM   
Citations 50

3
Updated on Jan 29, 2023

Web of ScienceTM
Citations 50

3
Updated on Jan 31, 2023

Page view(s)

155
Updated on Feb 5, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.