?
Comparison of the Probability of Reed – Solomon and LDPC Codes Decoding Error in the Gilbert – Elliott Channel
P. 1–4.
A. M. Veresova, A. A. Ovchinnikov
Channels with memory can be described using the Gilbert–Elliott model. To correct errors in such channels, non–
binary Reed-Solomon codes are used, as well as low-density parity-check codes together with interleaving procedure or modifications of classical decoding algorithms. The purpose of this study is to compare the effectiveness of these codes when using different decoding algorithms in channels with memory. The probability of decoding error for various channel parameters was estimated using simulation modeling. The study showed that as the number of errors outside the bursts increases, the Reed-Solomon codes begin to work worse than the special decoding algorithm for LDPC codes. Thus, in channels with a non-zero probability of errors in the "good" state, it is reasonable to use low density parity check codes.
Ovchinnikov A., Fominykh A., , in: Распределённые компьютерные и телекоммуникационные сети: управление, вычисление, связь (DCCN-2023).: -, 2023. P. 101–106.
Product code construction is a powerful error-correcting tool for both channels with and without memory. The common approach to decoding product (iterative) code is to apply consequent decoders in a sequential manner. The paper examines the influence of memory in the channel on iterative decoding for hard decision, soft decision, and trellis-based decoding algorithms. Also, ...
Added: December 18, 2025
Логвиненко Т. И., Стрельцова А. В., Otstavnov N. et al., Вопросы образования 2025 № 2 С. 101–141
The aim of this article is to review empirical studies, meta-analyses and systematicreviews on educational interventions for developing and improving reading compre-hension in adolescents, including both typically developing readers and those ex-periencing reading difficulties. We distinguish seven intervention types aimed at im-proving reading comprehension, each targeting different components as the basisfor intervention: decoding and reading ...
Added: December 11, 2025
Lotonina K., Fedorenko Sergei Valentinovich, Olshevskaia O., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–4.
A novel method of construction of the discrete Fourier transform (DFT) over the finite field has been proposed. The method is based on a polynomial representation of the DFT computation. We choose to minimize the sum of the number of operations (multiplications and additions) over a finite field as the optimization criterion. The presented method ...
Added: November 10, 2025
Исаева М. Н., Научно-технический вестник информационных технологий, механики и оптики 2025 Т. 25 № 2 С. 286–294
When transmitting information over channels with grouping errors, the traditional approach is channel decorrelation and use of codes correcting independent errors. The decorrelation procedure lowers achievable rates of reliable transmission, therefore the problem of using special codes for channels with memory and construction of computationally effective decoding methods for correction of grouping errors is actual. ...
Added: September 18, 2025
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
V. I. Morozov, O. O. Evsyutin, S. I. Nefedov, Problems of Information Transmission 2025 Vol. 61 No. 1 P. 8–26
One of the main applications of quantum communication is quantum key distribution, which solves the problem of secure distribution of cryptographic keys between remote users. This paper investigates the performance of a phase-time coding quantum key distribution protocol belonging to the BB84 protocol family. We construct a simulation model that takes into account the peculiarities ...
Added: April 22, 2025
Veresova A., Ovchinnikov A., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 47–51.
Added: November 27, 2024
Fominykh A., Ovchinnikov A., , in: Distributed Computer and Communication Networks: Control, Computation, Communications: 26th International Conference, DCCN 2023, Moscow, Russia, September 25–29, 2023, Revised Selected Papers.: Switzerland: Springer, 2023. P. 478–489.
Product code construction is a powerful error-correcting tool for both channels with and without memory. The common approach to decoding product codes is to apply consequent decoders in a sequential manner. The paper examines the influence of memory in the channel on iterative decoding for hard decision, soft decision, and trellis-based decoding algorithms. Also, the ...
Added: October 31, 2023
Никольская Т. Е., Павлина С. Ю., Вестник Волгоградского государственного университета. Серия 2: Языкознание 2019 Т. 18 № 1 С. 132–145
The article investigates inter-cultural artistic communication which occurs through multimodal texts in general and feature films in particular. Artistic communication faces a challenge when its source and target belong to different ethnic and/or generational cohorts. The similarity or difference of communication codes depends on the level of adequacy of the sender’s and the recipient’s discursive ...
Added: September 19, 2023
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 2023
Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–5.
The common technique to perform decoding in channels with memory is to use interleaving, which increases both complexity and delay at the receiver. To overcome these limitations, coding scheme adaptation approaches might be used. One of the approaches is the optimization of long error-correcting codes and the modification of the decoder, taking into account the ...
Added: July 18, 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
А. А. Ovchinnikov, А. М. Veresova, Fominykh A. A., Информационно-управляющие системы 2022 No. 6 P. 41–52
In modern systems for communication, data storage and processing the error-correction capability of codes are estimated for memoryless channels. In real channels the noise is correlated, which leads to grouping error in bursts. A traditional method to fight this phenomenon is channel decorrelation, which does not allow developing of coding schemes, mostly utilizing the channel ...
Added: June 22, 2023
Ovchinnikov A., A. Veresova, Fominykh A. A., Proceedings of Telecommunication Universities 2022 Vol. 8 No. 4 P. 55–63
Although low-density parity-check (LDPC) codes in modern communication standards have been extensively studied over a memoryless channel, their burst error correction capacity in channels with memory has yet to be
thoroughly analyzed. The conventional approach to transmission in channels with memory uses interleaving within
a buffer of several codewords. However, such an approach reduces the efficiency of ...
Added: June 22, 2023
Terry S. C., Ivanov F., Muhammad R. K. et al., Journal of Information Security and Applications 2023 Vol. 76 Article 103530
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on Goppa codes, the original McEliece cryptosystem however, suffers from having very large public keys. To alleviate this problem, we define a new IKKR problem that is is NP-complete and use this assumption of the intracability if the ...
Added: December 28, 2022
Kurmukova A., Ivanov F., Zyablov V. V., Problems of Information Transmission 2022 Vol. 58 No. 2 P. 122–136
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 ...
Added: November 19, 2022
A. M. Veresova, A. A. Ovchinnikov, , in: 2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2020. P. 1–4.
The main concepts of the metric description of memory channels are considered, as well as a specific metric for
such channels. The spectral properties of the Gilbert code in relation to the Markov metric are analyzed. It is shown that using a matched metric increases the efficiency of channel usage. ...
Added: October 30, 2022
Andrei Ovchinnikov, Fominykh A., , in: Internet of Things, Smart Spaces, and Next Generation Networks and Systems. 20th International Conference, NEW2AN 2020, and 13th Conference, ruSMART 2020, St. Petersburg, Russia, August 26–28, 2020, Proceedings, Part IIssue 12525.: Springer, 2020. P. 393–401.
Hard-decision decoders are considered for burst error correction for low-density parity-check codes. The decoder for block-permutation construction of low-density parity-check proposed. Experiments on complexity and error probability are conducted with burst lengths both within and beyond the burst error correction capability. Also simulation results for Gilbert model are presented. ...
Added: October 27, 2022
Ovchinnikov A., Fominykh A. A., , in: WAVE ELECTRONICS AND ITS APPLICATION IN INFORMATION AND TELECOMMUNICATION SYSTEMS. 2021. (WECONF 2021) St. Petersburg, Russia, 31 May - 4 June 2021.: IEEE, 2021. P. 1–4.
Added: October 27, 2022
Alina M. Veresova, Fominykh A. A., Andrei A. Ovchinnikov, , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 143–148.
The applying of low-density parity-check codes is
considered over two-state channels with memory described by
Markov and Gilbert models. The error probability using different
strategies of syndrome decoding is estimated. The method of
choosing the coset leaders is proposed which provides the
error probability close to maximum-likelihood decoding for the
considered codes. ...
Added: October 27, 2022
Fedorenko Sergei Valentinovich, IEEE Access 2022 Vol. 10 P. 110639–110645
A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity. ...
Added: October 26, 2022