List decoding of cover metric codes up to the singleton bound
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-...
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/145458 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A new class of rank-metric codes and their list decoding beyond the unique decoding radius
by: Xing, Chaoping, et al.
Published: (2020) -
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023) -
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
List decodability of symbol-pair codes
by: Liu, Shu, et al.
Published: (2020) -
List decoding of generalized Reed-Solomon codes over commutative rings
by: Armand, M.A.
Published: (2014)