Victor Vasil'Evich Zyablov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Victor Vasil'Evich Zyablov has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Sidorenko
Institute for Communications Engineering, Technical University of Munich, Munich, Germany
21 shared publications - Alexey Frolov
Skolkovo Institute of Science and Technology, Moscow, Russia
17 shared publications M. Bossert
Ulm University
14 shared publicationsR. Johannesson
Lund University
14 shared publicationsChristian Senger
Inst. of Telecommunications and Applied Information Theory, Ulm University, Germany
11 shared publications- Martin Bossert
Institute of Communications Engineering, Ulm University, Ulm, Germany
10 shared publications
Latest Publications
- 3 June 2026
- Published by Springer Nature
- p. 436-450
One Approach on Improved Communication Secrecy
- 3 June 2026
- Published by Springer Nature
- p. 54-65
A New Class of Codes with Error Localization: on Improvement of Decoding Algorithms
- 3 June 2026
- Published by Springer Nature
- p. 54-65
A New Class of Codes with Error Localization: on Improvement of Decoding Algorithms
- Open Access
Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes
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). The expressions we obtained for lower and upper BER bounds are based on the active distances of the code and their distance spectrum. The estimates are derived for convolutional codes with the rate $R=\frac{1}{2}$ but can be easily generalized for any convolutional code with rate $R=\frac 1n$ and systematic encoder. The suggested approach is not computationally expensive for any crossover probability of BSC channel and convolutional code memory, and it allows to obtain precise estimates of BER.Open AccessUpper and Lower Bounds on Bit-Error Rate for Convolutional Codes
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). The expressions we obtained for lower and upper BER bounds are based on the active distances of the code and their distance spectrum. The estimates are derived for convolutional codes with the rate $R=\frac{1}{2}$ but can be easily generalized for any convolutional code with rate $R=\frac 1n$ and systematic encoder. The suggested approach is not computationally expensive for any crossover probability of BSC channel and convolutional code memory, and it allows to obtain precise estimates of BER. - 1 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 184-201
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding
We consider the problem of constructing a cryptosystem with a public key based on error-resistant coding. At present, this type of cryptosystems is believed to be able to resist the advent of quantum computers and can be considered as a method of post-quantum cryptography. The main drawback of a code-based cryptosystem is a great length of the public key. Most papers devoted to reducing the cryptosystem key length consisted in replacing the Goppa codes used in the original cryptosystem with some other codes with a requirement that the system remains secure against attacks by a quantum computer. Here we propose another approach to the key length reduction that is stated as a task of a simple description of an error set which has either errors of weights greater than half the minimum distance or errors that cannot be corrected without an additional secret knowledge. If a code structure allows to give such a description of an error set, then the complexity of most attacks (for instance, information-set decoding) significantly increases.
- 1 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 184-201
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding
We consider the problem of constructing a cryptosystem with a public key based on error-resistant coding. At present, this type of cryptosystems is believed to be able to resist the advent of quantum computers and can be considered as a method of post-quantum cryptography. The main drawback of a code-based cryptosystem is a great length of the public key. Most papers devoted to reducing the cryptosystem key length consisted in replacing the Goppa codes used in the original cryptosystem with some other codes with a requirement that the system remains secure against attacks by a quantum computer. Here we propose another approach to the key length reduction that is stated as a task of a simple description of an error set which has either errors of weights greater than half the minimum distance or errors that cannot be corrected without an additional secret knowledge. If a code structure allows to give such a description of an error set, then the complexity of most attacks (for instance, information-set decoding) significantly increases.
- 1 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 122-136
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel
We propose a new approach to the analytical estimation of the error burst probability, the probability of erroneous decoding, and the probability of error per bit for convolutional codes with Viterbi decoding in a binary symmetric channel (BSC). Upper and lower estimates of the probability of error per bit and of the erroneous decoding probability are based on active distances and the distance spectrum of active distances for a convolutional code. The estimates are derived for rate \({1}/{2}\) convolutional codes, but they can also be generalized to any convolutional code with rate \({1}/{n}\). Calculation of the estimates described here has linear time complexity in the error burst minimal length if code distance properties are known. The computational complexity does not depend on the crossover probability of a BSC. Simulation results show that the considered estimates are rather tight, especially for small crossover probabilities.- 1 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 122-136
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel
We propose a new approach to the analytical estimation of the error burst probability, the probability of erroneous decoding, and the probability of error per bit for convolutional codes with Viterbi decoding in a binary symmetric channel (BSC). Upper and lower estimates of the probability of error per bit and of the erroneous decoding probability are based on active distances and the distance spectrum of active distances for a convolutional code. The estimates are derived for rate \({1}/{2}\) convolutional codes, but they can also be generalized to any convolutional code with rate \({1}/{n}\). Calculation of the estimates described here has linear time complexity in the error burst minimal length if code distance properties are known. The computational complexity does not depend on the crossover probability of a BSC. Simulation results show that the considered estimates are rather tight, especially for small crossover probabilities.- Open Access
Error Exponents of LDPC Codes under Low-Complexity Decoding
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity decoding algorithms. We prove the existence of such LDPC codes that the probability of erroneous decoding decreases exponentially with the growth of the code length while keeping coding rates below the corresponding channel capacity. We also show that an obtained error exponent lower bound under ML decoding almost coincide with the error exponents of good linear codes.
Open AccessError Exponents of LDPC Codes under Low-Complexity Decoding
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed low-complexity decoding algorithms. We prove the existence of such LDPC codes that the probability of erroneous decoding decreases exponentially with the growth of the code length while keeping coding rates below the corresponding channel capacity. We also show that an obtained error exponent lower bound under ML decoding almost coincide with the error exponents of good linear codes.
- 23 August 2017
- Published by Springer Nature
- p. 217-227
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations
- 23 August 2017
- Published by Springer Nature
- p. 217-227
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-20
On the code distance of a woven block code construction
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-20
On the code distance of a woven block code construction
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
- 1 June 2017
- Published by Pleiades Publishing Ltd in Journal of Communications Technology and Electronics
- Vol. 62 (6) , 704-712
Signal-code constructions for conflict-free wireless networks
This paper considers the possibility of constructing new-generation conflict-free (both cellular and peer-to-peer) synchronous broadband wireless networks in which users can simultaneously transmit information in the same frequency band without conflicts (media access collisions). This kind of networks can be constructed by combining the theory of code division multiple access (CDMA) with the broadcasting method. Here, broadcasting means that the user transmits information to a group of users within its radio line of sight by inserting a message header into a unified codeword.
- 1 June 2017
- Published by Pleiades Publishing Ltd in Journal of Communications Technology and Electronics
- Vol. 62 (6) , 704-712
Signal-code constructions for conflict-free wireless networks
This paper considers the possibility of constructing new-generation conflict-free (both cellular and peer-to-peer) synchronous broadband wireless networks in which users can simultaneously transmit information in the same frequency band without conflicts (media access collisions). This kind of networks can be constructed by combining the theory of code division multiple access (CDMA) with the broadcasting method. Here, broadcasting means that the user transmits information to a group of users within its radio line of sight by inserting a message header into a unified codeword.
- 1 April 2017
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 53 (2) , 114-135
Generalized error-locating codes with component codes over the same alphabet
We consider generalized error locating (GEL) codes over the same alphabet for both component codes. We propose an algorithm for computing an upper bound on the decoding error probability under known input symbol error rate and code parameters. Is is used to construct an algorithm for selecting code parameters to maximize the code rate for a given construction and given input and output error probabilities. A lower bound on the decoding error probability is given. Examples of plots of decoding error probability versus input symbol error rate are given, and their behavior is explained.
- 1 April 2017
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 53 (2) , 114-135
Generalized error-locating codes with component codes over the same alphabet
We consider generalized error locating (GEL) codes over the same alphabet for both component codes. We propose an algorithm for computing an upper bound on the decoding error probability under known input symbol error rate and code parameters. Is is used to construct an algorithm for selecting code parameters to maximize the code rate for a given construction and given input and output error probabilities. A lower bound on the decoding error probability is given. Examples of plots of decoding error probability versus input symbol error rate are given, and their behavior is explained.