Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions
Constructing Reed–Solomon (RS) codes that can correct insertions and deletions (insdel
errors) has been considered in numerous recent works. Our focus in this paper is on the
special case of two-dimensional RS-codes that can correct from insdel errors, the maximal
possible number of insdel errors a two-dimensional linear code can recover from. It is known
that an RS-code that can correct from insdel errors satisfies that. On the other hand, there
are several known constructions of RS-codes that can correct from insdel errors, where the …
errors) has been considered in numerous recent works. Our focus in this paper is on the
special case of two-dimensional RS-codes that can correct from insdel errors, the maximal
possible number of insdel errors a two-dimensional linear code can recover from. It is known
that an RS-code that can correct from insdel errors satisfies that. On the other hand, there
are several known constructions of RS-codes that can correct from insdel errors, where the …
Constructing Reed–Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. Our focus in this paper is on the special case of two-dimensional RS-codes that can correct from insdel errors, the maximal possible number of insdel errors a two-dimensional linear code can recover from. It is known that an RS-code that can correct from insdel errors satisfies that . On the other hand, there are several known constructions of RS-codes that can correct from insdel errors, where the smallest field size is . In this short paper, we construct Reed–Solomon codes that can correct insdel errors with , thereby resolving the minimum field size needed for such codes.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果