11 citations · 37 across the 12 of their papers we have counts for
4 papers · 1 filter
Upper and Lower Bounds on the Minimum Distance of Expander Codes
Alexey Frolov, Victor Zyablov
The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-…
Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm
Christian Senger, Vladimir R. Sidorenko, Martin Bossert +1
Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/er…
Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilit…
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Antonia Wachter, Vladimir Sidorenko, Martin Bossert +1
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this co…