Saved in:
| Main Authors: | Chen, Yeyuan, Zhang, Zihan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.15925 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)
by: Con, Roni, et al.
Published: (2024)
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)
by: Guo, Zeyu, et al.
Published: (2023)
Generic Reed-Solomon Codes Achieve List-decoding Capacity
by: Brakensiek, Joshua, et al.
Published: (2022)
by: Brakensiek, Joshua, et al.
Published: (2022)
Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)
by: Alrabiah, Omar, et al.
Published: (2023)
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes
by: Shang, Kuo, et al.
Published: (2026)
by: Shang, Kuo, et al.
Published: (2026)
Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)
by: Chen, Yeyuan, et al.
Published: (2025)
On the number of inequivalent linearized Reed-Solomon codes
by: Mannaert, Jonathan, et al.
Published: (2026)
by: Mannaert, Jonathan, et al.
Published: (2026)
Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)
by: Doron, Dean, et al.
Published: (2024)
More MDS codes of non-Reed-Solomon type
by: Wu, Yansheng, et al.
Published: (2024)
by: Wu, Yansheng, et al.
Published: (2024)
List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring
by: Yuan, Chen, et al.
Published: (2025)
by: Yuan, Chen, et al.
Published: (2025)
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
by: Guo, Zeyu, et al.
Published: (2024)
by: Guo, Zeyu, et al.
Published: (2024)
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)
by: Berman, Amit, et al.
Published: (2024)
Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)
by: Srivastava, Shashank
Published: (2024)
Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)
by: Wang, Chen, et al.
Published: (2026)
Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
by: Ashvinkumar, Vikrant, et al.
Published: (2025)
by: Ashvinkumar, Vikrant, et al.
Published: (2025)
Coding Theorem for Generalized Reed-Solomon Codes
by: Zheng, Xiangping, et al.
Published: (2025)
by: Zheng, Xiangping, et al.
Published: (2025)
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)
by: Guo, Zeyu, et al.
Published: (2026)
Generalized Hyperderivative Reed-Solomon Codes
by: Can, Mahir Bilen, et al.
Published: (2025)
by: Can, Mahir Bilen, et al.
Published: (2025)
Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
by: Ly, Hoang, et al.
Published: (2025)
by: Ly, Hoang, et al.
Published: (2025)
The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)
by: Xiong, Yanzhen, et al.
Published: (2026)
Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)
by: Jeronimo, Fernando Granha, et al.
Published: (2026)
Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)
by: Langberg, Michael, et al.
Published: (2025)
Unique Decoding of Hyperderivative Reed-Solomon Codes
by: Gu, Haojie, et al.
Published: (2026)
by: Gu, Haojie, et al.
Published: (2026)
Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
Hermitian Self-dual Generalized Reed-Solomon Codes
by: Zhao, Chun'e, et al.
Published: (2026)
by: Zhao, Chun'e, et al.
Published: (2026)
Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
by: Singhvi, Shubhransh, et al.
Published: (2026)
by: Singhvi, Shubhransh, et al.
Published: (2026)
MDS and NMDS Codes from the Extended Twisted Generalized Reed-Solomon Codes
by: Wang, Yanli, et al.
Published: (2026)
by: Wang, Yanli, et al.
Published: (2026)
A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
by: Tang, Nianqi, et al.
Published: (2025)
by: Tang, Nianqi, et al.
Published: (2025)
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)
by: Hollmann, Henk D. L., et al.
Published: (2024)
Weight Distribution of the Weighted Coordinates Poset Block Space and Singleton Bound
by: Shriwastva, Atul Kumar, et al.
Published: (2025)
by: Shriwastva, Atul Kumar, et al.
Published: (2025)
Decoding rank metric Reed-Muller codes
by: Couvreur, Alain, et al.
Published: (2025)
by: Couvreur, Alain, et al.
Published: (2025)
Column Twisted Reed-Solomon Codes as MDS Codes
by: Liu, Wei, et al.
Published: (2025)
by: Liu, Wei, et al.
Published: (2025)
Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
by: Zhao, Chun'e, et al.
Published: (2025)
by: Zhao, Chun'e, et al.
Published: (2025)
Deep Holes of Twisted Reed-Solomon Codes
by: Fang, Weijun, et al.
Published: (2024)
by: Fang, Weijun, et al.
Published: (2024)
Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)
by: Yang, Yulin
Published: (2026)
LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)
by: Mosheiff, Jonathan, et al.
Published: (2019)
Similar Items
-
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024) -
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023) -
Generic Reed-Solomon Codes Achieve List-decoding Capacity
by: Brakensiek, Joshua, et al.
Published: (2022) -
Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023) -
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)