Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
Erasure list decoding was introduced to correct a larger number of erasures by outputting a list of possible candidates. In this paper, we consider both random linear codes and algebraic geometry codes for list decoding from erasures. The contributions of this paper are twofold. First, for arbitrary...
Saved in:
Main Authors: | Ding, Yang, Jin, Lingfei, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81744 http://hdl.handle.net/10220/39667 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
Similar Items
-
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
by: Jin, Lingfei, et al.
Published: (2020) -
Constructions of maximally recoverable Local Reconstruction Codes via function fields
by: Guruswami, Venkatesan, et al.
Published: (2020) -
A generalization of algebraic-geometry codes
by: Xing, C., et al.
Published: (2013) -
Multistage list decoding of generalized Reed-Solomon codes over Galois rings
by: Armand, M.A., et al.
Published: (2014) -
Asymptotic bounds on quantum codes from algebraic geometry codes
by: Feng, K., et al.
Published: (2014)