?
Upper and Lower Estimates of Frame Error Rate for Convolutional Codes
P. 160–164.
Language:
English
Ilina A., Planche L., Shchur V., Lobachevskii Journal of Mathematics 2025 No. 46 P. 3537–3544
Many modern human populations contain archaic Neanderthal segments through the archaic introgression event, which occurred 45,000–55,000 years ago. There are a few computational methods that could infer such tracts. The results of their inference is used in the downstream analysis to better understand the impact of the archaic component on the genetic diversity of modern ...
Added: November 29, 2025
Alina M. Veresova, Andrei A. Ovchinnikov, , in: 2024 IEEE 3rd International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE).: IEEE, 2024. P. 1130–1134.
The article discusses the data transmission using convolutional codes over channels where the noise process can be described by a Markov chain with two states: a simple binary Markov channel and the Gilbert channel. Using the classical Viterbi algorithm with the Hamming metric for these channels does not guarantee low error probabilities. Additionally, the use ...
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
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
Курмукова А. А., Зяблов В. В., / Series arXiv "math". 2022. No. 1.
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 ...
Added: December 27, 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
Смешко А. А., Ivanov F., Zyablov V., , in: Proceedings of 2020 International Symposium on Information Theory and its Applications.: IEEE, 2020.
Added: November 2, 2021
Antonov I., Borodovsky M., Journal of Bioinformatics and Computational Biology 2010 Vol. 8 No. 3 P. 535–551
We describe a new program for ab initio frameshift detection in protein-coding nucleotide sequences. The task is to distinguish the same strand overlapping ORFs that occur in the sequence due to a presence of a frameshifted gene from the same strand overlapping ORFs that encompass true overlapping or adjacent genes. The GeneTack program uses a ...
Added: March 19, 2021
Смешко А. А., Ivanov F., Zyablov V., , in: Proceedings of 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2019. P. 110–114.
In this paper, we consider the dependence between active distances for convolutional code and the distribution of bursts at the output after Viterbi decoding. We suggest an estimate of the probability of bursts of a certain length based on the active row distances of the code and present a formula for our estimation.We take into ...
Added: October 30, 2020
Ivanov F., Kreshchuk A., Zyablov V., , in: Pocceeding of the International Symposium on Information Theory and Its Applications (ISITA 2018).: Singapore: IEEE, 2018. P. 296–300.
In this paper the decoding capabilities of convolutional codes over the erasure channel are studied. More precisely we focus on local erasures correction. We present special decoders that are able to correct significantly more erasures locally than block codes of the same rate.
We also present some expressions that connect the number of possible corrected erasures ...
Added: January 9, 2019
Nikitin O., Polushin P., Saleh H., , in: Actual Problems of System and Software Engineering 2017. Proceedings of the 5th International Conference on Actual Problems of System and Software Engineering Supported by Russian Foundation for Basic Research. Project #17-07-20565 Moscow, Russia, November 14-16, 2017, 408 P.Vol. 1989.: Aachen: CEUR Workshop Proceedings, 2017. P. 111–119.
The modification of algorithm of Viterbi convolutional decoding for the fading channels and use of interleaving of symbols is described. The modification represents the use of additional correcting coefficients in the process of calculation of metrics of various parts in the trellis diagram. It gives opportunity to reduce the probability of errors of decoded symbols. ...
Added: December 21, 2017