List decoding of rank-metric and cover-metric codes
A fundamental challenge in coding theory is to efficiently decode the original transmitted message even when a few symbols of the received word are erroneous. Traditionally, unique decoding outputs a unique codeword and can only correct up to half the minimum distance of the code. An alternative not...
Saved in:
Main Author: | Liu, Shu |
---|---|
Other Authors: | Wang Huaxiong |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/74108 |
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) -
A lower bound on the list-decodability of insdel codes
by: Liu, Shu, et al.
Published: (2023) -
On List-Decodability of Random Rank Metric Codes and Subspace Codes
by: Ding, Yang
Published: (2016) -
A new class of rank-metric codes and their list decoding beyond the unique decoding radius
by: Xing, Chaoping, et al.
Published: (2020) -
Harnack inequality under the change of metric
by: Tasena,S., et al.
Published: (2015)