A lower bound on the list-decodability of insdel codes
For codes equipped with metrics such as Hamming metric, symbol pair metric or cover metric, the Johnson bound guarantees list-decodability of such codes. That is, the Johnson bound provides a lower bound on the list-decoding radius of a code in terms of its relative minimum distance, list size and t...
Saved in:
Main Authors: | Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/169889 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
On pseudo-noise sequences
by: Rubin, Karlyn Anne C., et al.
Published: (2010) -
New bounds on the minimum distance of cyclic codes
by: Ling, San, et al.
Published: (2021) -
List decoding of cover metric codes up to the singleton bound
by: Liu, Shu, et al.
Published: (2020) -
The problem of Ulam: (An application of coding theory)
by: Malonzo, Dexter G., et al.
Published: (1997)