A new class of rank-metric codes and their list decoding beyond the unique decoding radius
Compared with classical block codes, list decoding rank-metric codes efficiently seems more difficult. The evidences to support this view include: 1) so far the only known efficient list decoding of rank-metric codes C gives decoding radius beyond (1 - R)/2 with positive rate R when the ratio of the...
Saved in:
Main Authors: | 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/145452 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
List decoding of cover metric codes up to the singleton bound
by: Liu, Shu, et al.
Published: (2020) -
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023) -
List decodability of symbol-pair codes
by: Liu, Shu, et al.
Published: (2020) -
On List-Decodability of Random Rank Metric Codes and Subspace Codes
by: Ding, Yang
Published: (2016)