?
On the improvements of successive cancellation Creeper decoding for polar codes
Digital Signal Processing. 2023. Vol. 137. Article 104008.
Timokhin I., Ivanov F.
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 slight increase in space complexity. We also show how to combine the SC-Creeper decoding with a bit-flipping approach to further improve the performance of SC-Creeper due to introducing additional decoding attempts.
Simulation results show that the proposed SC-Creeper and SC-Creeper Flip decoders with carefully selected parameters have the same performance as both CRC-aided Successive Cancellation List decoder with list size 8 and Fano decoder, while having much smaller complexity.
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Hualin M., Jie Z., Jerome Y. et al., Journal of Internet Technology 2026 Vol. 27 No. 3 P. 367–382
In open, interference-prone scenarios, the scarcity of precisely annotated signal samples limits the application of deep learning–based modulation identification, which generally relies on extensive labeled data for stability. Relation Networks, as an emerging class of deep learning models, exhibit rapid convergence in few-shot learning tasks. Motivated by the fast convergence property of relation-based learning and ...
Added: July 3, 2026
Osipov D., Информационно-управляющие системы 2026 № 3 С. 49–62
Introduction: In many communication systems under construction and those to be created power control and channel estimation techniques developed for the previous generation communication systems fail to provide desired precision. One way to solve this problem is to use order-statistics-based reception techniques that do not need channel estimation or power control. To ensure the desired ...
Added: July 3, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Netherlands: ScienceDirect, 2025.
No ...
Added: June 28, 2026
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
Ivanov F., Kuvshinov A., , in: 2025 17th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).: Niš: IEEE, 2025. 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 ...
Added: November 29, 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
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
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