?
Theoretical Estimation of the Probability of Error of the U-UV Code
P. 79–82.
An analysis of error probability of decoding of (U∣U+V) construction is described in this paper. The derivation of the probability of decoding error is shown for (U∣U+V) sequential decoder. The observed theoretical probability of error can be extended to (U∣U+V) constructions with varying numbers of levels. The method is derived for an additive white gaussian noise channel (AWGN). The presented expression depends on channel parameters, code length and the number of errors that components can correct. Moreover, the task of maximizing the code rate of the (U∣U+V) code with component codes having the Gilbert-Varshamov minimum distance is depicted. Simulation results demonstrate the coincidence of theoretical results with simulated probability of decoding failure. The GilbertVarshamov rates profile on signal-to-noise (SNR) ratio for different probability of decoding error is also shown.
Kuvshinov A., Fominykh A., Ivanov F., IEEE Access 2026 Vol. 14 P. 50549–50557
The recursive (U|U+V) construction, a generalization of which includes polar codes, provides a powerful framework for building complex codes from simpler components. However, existing approaches predominantly rely on fixed or symmetric tree architectures, overlooking the critical impact of decomposition choice on code performance. This paper addresses the challenge of optimal tree decomposition selection by presenting a framework ...
Added: April 7, 2026
Котов Ф. И., Timokhin I., Ivanov F., , in: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).: IEEE, 2023.
The Successive Cancellation List (SCL) algorithm is a widely used decoding technique in communication systems. However, constructing the critical set for SCL decoding is a challenging task, as it requires a large number of computations and can lead to significant decoding delays. In this paper, a new approach to critical set construction for SCL decoding ...
Added: January 26, 2026
Ovchinnikov A., Научно-технический вестник информационных технологий, механики и оптики 2024 Vol. 25 No. 1 P. 53–60
Error correction during data storage, processing, and transmission allows for ensuring data integrity. Channel coding
techniques are used to counteract these errors. Noise in real systems is often correlated, whereas traditional coding
and decoding approaches are based on decorrelation which in turn reduces the performance limits of channel coding.
Polar codes, adopted as a coding scheme in the ...
Added: May 14, 2025
Kuvshinov A., Timokhin I., Ivanov F., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 52–57.
Concatenated codes are currently being actively investigated for the next-generation wireless communication sys tems due to their flexibility and ability to be used in various scenarios. The serial type of concatenation provides good error correcting properties with a potential reduction in complexity when an iterative concatenated decoder is used at the receiver side. One of ...
Added: November 16, 2024
Timokhin I., Ivanov F., IEEE Access 2024 Vol. 12 P. 86639–86648
Polar codes have emerged as a focal point in the field of error-correcting codes, owing to their remarkable capacity-achieving characteristics and their relevance in various modern communication systems. The basic successive cancellation (SC) approach is not optimal to use in terms of the trade-off between performance and decoding complexity. SC-Creeper algorithm performs better with about ...
Added: September 5, 2024
Evsyutin O., Ivanov F., Dzhanashia K., IEEE Access 2024 Vol. 12 P. 118154–118168
Protecting ownership of digital content is challenging in today’s online world, especially when sharing content through social networks and instant messengers. One possible solution is the use of watermarking; however, if the watermarking method is not robust enough, the watermark can get damaged or erased during transmission. This study introduces a template-based watermarking method with ...
Added: September 1, 2024
Timokhin I., Ivanov F., Applied Sciences (Switzerland) 2024 Vol. 14 No. 5 P. 1847
Added: March 5, 2024
Ilya S. Timokhin, Fedor I. Ivanov, , in: 2023 IEEE 24th International Conference of Young Professionals in Electron Devices and Materials (EDM).: IEEE, 2023. P. 360–365.
Polar codes have gained significant a ttention in recent years due to their superior performance, making them an attractive choice for use in modern communication systems. In this paper, we present a novel approach for implementing a fast decoding method for polar codes with additional nodes. Specifically, we propose a modification of the fast decoding ...
Added: September 7, 2023
Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–4.
Satellite and space communication systems have received a lot of attention as crucial transmission frameworks in recent years. In these systems, the signal is mostly degraded by fast amplitude and phase changes (fading), which cause error bursts. Hence, robust error-correcting codes that can handle error bursts are necessary for space and satellite transmissions of good ...
Added: July 18, 2023
Timokhin I., Ivanov F., Digital Signal Processing 2023 Vol. 137 Article 104008
In this paper, an improvement for successive cancellation (SC) decoding is presented for polar codes. This improvement is based on applying Creeper approach that was used to decode convolutional codes. The proposed decoder combines a stack and a Fano approaches, allowing to significantly decrease complexity of Successive Cancellation Fano decoder at the cost of a ...
Added: March 18, 2023
Ivanov F., Четвериков И. С., Kreshchuk A. et al., Proceedings of the IEEE 2022 P. 60–64
In this paper, an improvement for successive cancellation (SC) decoding is presented for polar codes. This improvement is based on applying Creeper approach that was used to decode convolutional codes. The proposed decoder combines a stack and a Fano approaches and allows to significantly decrease complexity of Successive Cancellation Fano decoder at the cost of ...
Added: January 26, 2023
Osipov D., / Series arXiv "math". 2022. No. 1.
This paper devotes to comparison of different cod- ing schemes (various constructions of Polar and LDPC codes, Product codes and BCH codes) for the case when information is transmitted over AWGN channel with quantization with lowest possible complexity and resolution: 1-bit. We examine performance (in terms of Frame-error-rate — FER) for schemes mentioned above and ...
Added: December 27, 2022
Ivanov F., Morishnik V., Krouk E., Journal of Communications and Networks 2021 Vol. 23 No. 6 P. 417–432
In this paper, an improvement for SC list flip (SCL-Flip) decoding is presented for polar
codes. A novel bit-selection metric for critical set (set of information symbols of polar codes being flipped during additional decoding attempts) based on path metric of successive cancellation list (SCL) decoding is suggested. With the proposed metric, the improved SCL scheme ...
Added: November 30, 2021
Osipov D., Titov D., Cybernetics and Information Technologies 2018 Vol. 18 No. 5 P. 77–86
The following paper adapts the classical Zigangirov-Jelinek algorithm to the decoding of nonbinary block codes under severe mixed jamming. To ensure reliable communications in this scenario we combine reception techniques based on distribution free statistical tests with sequential decoding on syndrome trellises. It will be shown that the proposed approach can ensure relatively high transmission ...
Added: July 6, 2018