11 citations · 37 across the 12 of their papers we have counts for
13 papers
Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes
Anastasia Kurmukova, Fedor Ivanov, Victor Zyablov
In this paper, we provide a new approach to the analytical estimation of the bit-error rate (BER) for convolutional codes for Viterbi decoding in the binary symmetric channel (BSC)…
On the Multiple Threshold Decoding of LDPC codes over GF(q)
Alexey Frolov, Victor Zyablov
We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A low…
On the Capacity of the Multiuser Vector Adder Channel
Alexey Frolov, Pavel Rybin, Victor Zyablov
We investigate the capacity of the -frequency -user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated…
On a Multiple-Access in a Vector Disjunctive Channel
Alexey Frolov, Victor Zyablov, Vladimir Sidorenko +1
We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case o…
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…
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…
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…
Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon Codes
Christian Senger, Vladimir Sidorenko, Martin Bossert +1
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most f…
Woven Graph Codes: Asymptotic Performances and Examples
Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov +1
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on -partite, $…