The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We... more
The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed–Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Furthermore, the failure probability is derived.
Research Interests:
Research Interests:
We present a fast equivalent of the Extended Euclidean Algorithm for linearized polynomials (LEEA). Linearized polynomials are used to define rank metric codes, e.g. Gabidulin codes. The proposed fast LEEA accelerates decoding of... more
We present a fast equivalent of the Extended Euclidean Algorithm for linearized polynomials (LEEA). Linearized polynomials are used to define rank metric codes, e.g. Gabidulin codes. The proposed fast LEEA accelerates decoding of Gabidulin codes since it solves the key equation with sub-quadratic complexity. In addition, we give a fast algorithm for calculating the symbolic product.
Research Interests:
Research Interests:
We present an algorithm for decoding Reed-Solomon codes beyond half the minimum distance by using reliability information which is based on the extended Euclidean algorithm. The algorithm constitutes a Generalized Minimum Distance decoder... more
We present an algorithm for decoding Reed-Solomon codes beyond half the minimum distance by using reliability information which is based on the extended Euclidean algorithm. The algorithm constitutes a Generalized Minimum Distance decoder since the reliability information is used to declare erasures in certain positions in the received word. We describe two methods to reduce the decoding complexity of this decoder.