2 citations · 3 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.IT2024
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
Roni Con, Zeyu Guo, Ray Li +1
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - w…
cs.IT2024
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
Zeyu Guo, Chaoping Xing, Chen Yuan +1
Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful posi…