Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions

文章

学术资源搜索

获得 1 条结果（用时0.01秒）

我的图书馆

Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions

在引用文章中搜索

[PDF] arxiv.org

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets

R Con, Z Guo, R Li, Z Zhang - arXiv preprint arXiv:2407.07299, 2024 - arxiv.org

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-with …

高级搜索

QQ 群

Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets

引用