5 papers
On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel
Christian Senger, Vladimir Sidorenko, Victor Zyablov
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder fo…
Trellis Computations
Axel Heim, Vladimir Sidorenko, Uli Sorger
For a certain class of functions, the distribution of the function values can be calculated in the trellis or a sub-trellis. The forward/backward recursion known from the BCJR algo…
Syndrome Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance based on Shift-Register Synthesis
Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert
In this paper, a new approach for decoding low-rate Reed-Solomon codes beyond half the minimum distance is considered and analyzed. Unlike the Sudan algorithm published in 1997, th…
Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs
Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert
Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinar…
Linear Shift-Register Synthesis for Multiple Sequences of Varying Length
Georg Schmidt, Vladimir R. Sidorenko
The problem of finding the shortest linear shift-register capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed b…