32 citations · 174 across the 33 of their papers we have counts for
5 papers · 2 filters
The Euclidean Algorithm for Generalized Minimum Distance Decoding of Reed-Solomon Codes
Sabine Kampf, Martin Bossert
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps taken to p…
A Basis for all Solutions of the Key Equation for Gabidulin Codes
Antonia Wachter, Vladimir Sidorenko, Martin Bossert
We present and prove the correctness of an efficient algorithm that provides a basis for all solutions of a key equation in order to decode Gabidulin (G-) codes up to a given radiu…
A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm
Sabine Kampf, Martin Bossert
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes w…
Adaptive Single-Trial Error/Erasure Decoding for Binary Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby, d is the minimum Hamming…
Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded Distance Decoders
Christian Senger, Vladimir R. Sidorenko, Martin Bossert +1
We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure (L+1)/L-extended Bounded Distance deco…