?
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.
Myachin A. L., Procedia Computer Science 2026 Vol. 287 P. 193–200
We extend the static pattern analysis method to the temporal dimension by introducing a six-type trajectory taxonomy that classifies objects according to the frequency and structure of pattern switches over an observation window of T > 8 periods. For each object, a reference pattern is designated as the most frequently occupied group over the observation ...
Added: September 18, 2026
Kuzyutin D., Smirnova N., Veselkov A., Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software 2026 Vol. 19 No. 3 P. 40–49
We consider spatial dynamic fishery management problem taking into account the resource migration process between an open-access fishing area and no-take marine protected area. The introduced extension of a standard single-criterion fish war game implies that each player aims to maximize simultaneously two performance criteria which present an economic benefit and an environmental conservation goal ...
Added: September 18, 2026
Громов Р. С., Нестеров Р.А., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 23–44
This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm
(BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...
Added: September 18, 2026
Ероховец Николай Юрьевич, Математический сборник 2026 Т. 217 № 5 С. 45–89
Toric topology assigns to each simple convex n-polytope P with m facets an n-dimensional real moment-angle manifold RZP with a canonical action of Zm2=(Z/2Z)m. We consider (not necessarily free) actions of subgroups H⊂Zm2 on RZP. The orbit space N(P,H)=RZP/H carries an action of Zm2/H. For general n we introduce the notion of Hamiltonian C(n,k)-subcomplex in the boundary of an ...
Added: September 17, 2026
Kuninets A., Malygina E., Cryptography and Communications 2026
In this paper, we determine explicit bases for Riemann–Roch spaces associated with various families of elliptic codes. We establish the feasibility and provide exact algorithms for constructing bases of Riemann–Roch spaces corresponding to arbitrary divisors on elliptic curves, including the non-effective case. These results are subsequently applied to derive bases for quasi-cyclic elliptic codes and ...
Added: September 17, 2026
Кузнецов М. Е., Полякова М., Лукьянович В. et al., ФАНУ "Востокгосплан", 2026.
Обзор международных практик развития робототехники и искусственного интеллекта и оценка возможностей их применения в условиях России, в первую очередь для Дальнего Востока и Арктической зоны РФ ...
Added: September 16, 2026
Kazakov A., Koryakin V., Safonov K. et al., Journal of Differential Equations 2026 Vol. 480 Article 114626
We study a family of one-dimensional maps that models the dynamics of a system of differential equations with a Lorenz attractor near a bifurcation curve where the system has a pair of homoclinic loops with zero separatrix value. Of particular interest is the region of the parameter plane where the map has a robust chaotic ...
Added: September 16, 2026
Letellier C., Stankevich N., Houri S. et al., Chaos 2026 Vol. 36 No. 9 Article 093128
Toroidal chaos designates a chaotic solution that is structured in the neighborhood of a torus. For being chaotic, such a torus needs to be discontinuously fractalized to present a Cantor set, ensuring the great sensitivity to initial conditions required for chaos. A fractal is related to self-similarity and a non-integer dimension. In fact, although clearly ...
Added: September 16, 2026
Poddiakov A., / Series Social Science Research Network "Social Science Research Network". 2026. No. 7437658.
Clarity of knowledge and reasoning is necessary in many cases. Yet vagueness in scientific thinking related to surprise, curiosity, "ability to engage with not-knowing" (de Freitas) and abductive reasoning is also a crucially important source of scientific creativity which supplements combinatorial logic when dealing with the already known. Starting from studies by C. S. Peirce ...
Added: September 15, 2026
Melman A., Evsyutin O., Computer Science Review 2027 Vol. 63 (A) Article 101066
One of the effective means of protecting digital images is invisible watermarking. Different scenarios have different requirements for watermark resistance to post-processing. Robust watermarking schemes are resistant to a wide range of modifications. Fragile watermarking schemes are designed for integrity control and are destroyed by even minor modifications of images. Semi-fragile watermarking schemes combine features ...
Added: September 15, 2026
Воронова К. Д., Lyadova L. N., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 153–170
Title: Automated Event Logs Generation Based on Unstructured Internet Sources for Process Analysis Tasks
Abstract. This paper presents an approach to automated structuring event-related information extracted from unstructured textual Internet sources for process mining tasks. In many practical cases, information on events associated with various processes is not presented in the form of ready-made event logs, but is ...
Added: September 14, 2026
Springer, 2026.
This book gathers selected papers from the KES-IDT 2025 conference, held in Solin, Croatia, on June 25–27, 2025. The book presents and discusses the latest research results and generates new ideas in the field of intelligent decision-making. The range of topics discussed is classification, prediction, data analysis, big data, data science, decision support, knowledge engineering, ...
Added: September 13, 2026
Lebedev O. B., Митяков Е. С., Саенко И. Б. et al., Информация и космос 2026 № 1 С. 53–58
The article presents a methodology for the integrated assessment of cyberattacks on industrial control systems (ICS) using a combination of the Ampire cyber range and a digital twin. The approach is based on calculating five criteria—severity, attacker capabilities, vulnerability, complexity, and defense effectiveness—that form an integrated threat index. Testing across three scenarios confirmed the index's ...
Added: September 13, 2026
Lebedev O. B., Лебедев Б. К., Бесхмельнов М. И., Известия ЮФУ. Технические науки 2024 № 2(242) С. 177–190
This article examines algorithms for generating motion trajectories for unmanned aerial vehicles (UAVs) during search-and-rescue and emergency response operations. It describes methods and algorithms for controlling the movement of a UAV group in various formations—such as line, rank, column, and during turns. Control is achieved through alternative collective adaptation algorithms based on principles of collective ...
Added: September 13, 2026
Lebedev O. B., Котов Д. В., Известия ЮФУ. Технические науки 2024 № 1(237) С. 155–167
The primary approach to solving motion planning and control problems involves the use of intelligent technologies. These technologies are applied to define and adjust control objectives and action programs, as well as to formulate control algorithms under conditions of uncertainty—stemming from various factors—across actuator elements and the motion control, planning, and behavioral subsystems. This paper ...
Added: September 13, 2026
Гибридный алгоритм оптимизации на основе объединения моделей роевого интеллекта: роя хромосом и пчел
Lebedev O. B., Лебедев Б. К., Ганжур М. А., Информатизация и связь 2023 № 2 С. 80–84
A hybrid algorithm has been developed to solve the VLSI component placement problem by combining procedures based on bee colony behavior and a chromosome swarm. The optimization criterion is based on estimates of the number of nets crossing specific lines within the routing area. A modified chromosome swarm paradigm is described; unlike the canonical method, ...
Added: September 13, 2026
Lebedev O. B., Лебедев Б. К., Бесхмельнов М. И., Вестник Тверского государственного технического университета 2025 № 3(27) С. 103–119
The article presents a detailed analysis of a hybrid path-planning algorithm designed for navigation in a two-dimensional space, accounting for partial uncertainty regarding terrain information. The algorithm operates in stages and is divided into two levels. At the first level, the object's local visibility zone is established, and the corresponding region on the map is ...
Added: September 12, 2026
Lebedev O. B., Лебедев Б. К., Бесхмельнов М. И., Известия ЮФУ. Технические науки 2025 Т. 2(244) С. 68–82
This paper describes a hybrid situational trajectory planning algorithm for 2D space operating under conditions of partial uncertainty. Based on the integration of wave-propagation and ant colony optimization algorithms, it enables the real-time generation of minimum-length trajectories while simultaneously optimizing other path quality criteria. The processes of generating a trajectory segment and moving the object ...
Added: September 12, 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
Kotov F., 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