?
2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.
IEEE, 2022.
Processing and transmission of information and telecommunication systems
It is supposed to consider the results of current and promising scientific research on:
- processing and transmission of information in infocommunication systems;
- solving problems of error-correcting coding, assessing the limiting characteristics of communication systems;
- methods of machine learning and decision making;
- solving urgent problems that are formed at the junction of information theory, coding theory, and queuing theory.
Chapters
A. A. Ovchinnikov, Fominykh A. A., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. P. 1–5.
The paper considers approaches to multistage decoding of linear codes. Cascade and iterative decoding techniques are well-known directions in coding theory. The idea of creating long codes from a combination of numerous short codes was presented in the 1950s. The paper proposes hybrid decoding algorithm that presents an approach to combine different decoding algorithms to use ...
Added: September 27, 2022
Isaeva M., Ovchinnikov A., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. P. 1–5.
This article discusses the problem of constructing a public-key code-based cryptosystem based on quasi-cyclic codes
and the hard task of complete decoding. Experiments analyzing the correcting ability of the considered code system are
presented. The ways of increasing the corrective ability of this code system are proposed. ...
Added: October 27, 2022
A. M. Veresova, A. A. Ovchinnikov, , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. P. 1–4.
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 ...
Added: October 27, 2022
Borisovskaya A. V., A. M. Turlikov, Fonfrygin A. S., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. Ch. 180440 P. 1–4.
Added: October 28, 2022
Nesterenkov O., Chemodanov A., Turlikov A., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. Ch. 180440 P. 1–5.
The number of devices transmitting any data is increasing rapidly every day, so modern wireless networks (especially sensor networks, where the number of sensors connected to one base station can be enormous) must adapt to new realities, and developers must change data transmission algorithms. In this article, we consider the problem of constructing the lower ...
Added: October 28, 2022
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Селянин Ф. И., Moscow Mathematical Journal 2026 Vol. 26 No. 2 P. 167–187
Minkowski mixed volume of n subpolytopes D1,…,Dn of a polytope P⊂Rn clearly does not exceed the normalized volume n!Vol(P). Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face F⊊P intersects at least dim(F)+1 of the polytopes Di. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems.
Motivated by relaxing the bound dim(F)+1 to dim(F), we ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., International Mathematics Research Notices 2026 Vol. 14 Article rnag146
We prove a recent conjecture of the fourth named author with P. Norbury that states a system of universal polynomial relations among the kappa classes on the moduli spaces of algebraic curves. The proof involves localization and materialization analysis of the spin Gromov–Witten theory of the projective line and is dictated by Z 2 -equivariant ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Communications in Mathematical Physics 2026 Vol. 407 No. 69
We prove that for any initial data on a genus zero spectral curve the cor responding correlation differentials of topological recursion are KP integrable. As an application we prove KP integrability of partition functions associated via ELSV-type formulas to the r-th roots of the twisted powers of the log canonical bundles ...
Added: August 31, 2026
Gromov V., Переслегин С. Б., Переслегина Е. Б. et al., СПб.: Полакс, 2026.
Механизм происходящих в мире изменений носит эволюционный, а не экологический характер. Иначе говоря, Человечество столкнулось с кризисом развития, который имеет три независимые составляющие: кризис индустриального общества (фазовый кризис), кризис научного мышления (эпистемный кризис) и кризис формата существования разума (социосистемный кризис). Доклад посвящён аспектам этого триединого кризиса и возможным путям его преодоления, не сводящимся к первичному ...
Added: August 31, 2026
Devyatov R. A., Mathematical notes 2026 Vol. 119 No. 3 P. 782–786
Let G/B be a flag variety over ℂ, where G is a simple algebraic group with a simply laced Dynkin diagram, and B is a Borel subgroup. We say that the product of classes of Schubert divisors in the Chow ring is multiplicity free if it is possible to multiply it by a Schubert class ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Journal fuer die reine und angewandte Mathematik 2026 Vol. 2026 No. 836 P. 111–162
We give a self-contained and simplified proof of Mukai’s classification of prime Fano threefolds of index 1 and genus g ≥ 6 with at most factorial terminal singularities, and of its extension to higher dimension. ...
Added: August 30, 2026
Bayer A., Kuznetsov A., Macrì E., Compositio Mathematica 2026 Vol. 162 No. 1 P. 59–99
We give a proof of Mukai’s theorem on the existence of certain exceptional vector bundles on prime Fano threefolds. To our knowledge this is the first complete proof in the literature. The result is essential for Mukai’s biregular classification of prime Fano threefolds, and for the existence of semiorthogonal decompositions in their derived categories. Our ...
Added: August 30, 2026
Guseva L., Novikov A., Advances in Mathematics 2026 Vol. 503 Article 111211
We prove that the Kuznetsov–Polishchuk exceptional collections on rational homogeneous spaces of the symplectic groups Sp(2n,C) are full and consist of vector bundles. To achieve this, we construct several classes of complexes, which we call generalized staircase complexes, symplectic staircase complexes and secondary staircase complexes — each of which may be of independent interest. ...
Added: August 30, 2026
Polishchuk A., Rains E., Journal of the Institute of Mathematics of Jussieu 2026 Vol. 25 No. 1 P. 339–373
We prove that for every relatively prime pair of integers (d,r) with r>0, there exists an exceptional pair (O,V) on any del Pezzo surface of degree 4, such that V is a bundle of rank r and degree d. As an application, we prove that every Feigin-Odesskii Poisson bracket on a projective space can be ...
Added: August 30, 2026
Kazhdan D., Polishchuk A., Pure and Applied Mathematics Quarterly 2026 Vol. 22 No. 3 P. 1115–1166
We continue the study of automorphic functions associated with a curve C over the ring k[ε]/(ε²), where k is a finite field, begun in arXiv:2303.16259. Namely, we study an example of theta-lifting in this framework and show that it can be understood in terms of the orbit decomposition of the space of automorphic functions S(SL₂(F)\SL₂(A_C)) ...
Added: August 30, 2026
Kuznetsov A. P., Sataev I. R., Stankevich N., Chaos 2026 Vol. 36 No. 8 Article 083131
A radio-physical system, namely, a two-mode van der Pol generator, is considered. It is shown that this system demonstrates two types of chaos: with one and two zero Lyapunov exponents. The regions of the second type of chaos are surrounded by bifurcation lines of invariant tori doubling. Quasi-periodic structures of various shapes are embedded within ...
Added: August 30, 2026
Shirokov N. A., Rozenblum G., Israel Journal of Mathematics 2026 P. 1–30
We establish that a generalized H\¨older continuous function on an (m−2)-Ahlfors regular compact set in Rm can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity modulus of the function ...
Added: August 29, 2026
Avdoshin S.M., Patrushev K. A., Proceedings of the Institute for System Programming of the RAS 2026 No. 4 часть 2 P. 245–256
The cardinality-constrained Markowitz problem is NP-hard and traditionally solved with commercial MIQP solvers. Following the 2022 export restrictions that rendered both commercial MIQP software and cloud quantum platforms (IBM Quantum, D-Wave Leap) inaccessible from the Russian Federation, practitioners require open-source alternatives. This paper systematically compares three solver families for the discrete mean-variance problem: two open-source ...
Added: August 27, 2026
Zaikin A., Vlasenko D., Zakharov D. et al., Diagnostics 2026 Vol. 16 No. 17 P. 1–15
Background/Objectives: Synolitic graphs (SGs) were developed for task-based fMRI, where
edge weights encode the discriminative power of pairwise regional features; whether similar
information can be recovered from resting-state data was untested. We benchmarked
SGs for autism spectrum disorder (ASD) classification using the multisite ABIDE-I dataset
(871 subjects: 403 subjects with ASD, 468 typical controls; 17 sites; CC200 atlas). Methods:
Using ...
Added: August 27, 2026
Melnikov I., Pelinovsky E., Nonlinear Dynamics 2026 No. 114 Article 934
Pyramidal solitons (solitons with more than two inflection points) of the generalized Korteweg–de Vries (KdV) equation are investigated. Necessary and sufficient conditions for the existence of such structures are presented. Within the framework of the generalized Gardner equation — the simplest model that admits pyramidal solitons as solutions — it is shown that these solutions ...
Added: August 27, 2026
Burkov Artem A., Rogov Danil V., Sharipov Kamil A. et al., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–7.
The paper presents a comparison of the redundancy introduced when transmitting data using the QUIC and TCP protocols. Issues concerning the impact of redundancy—including that introduced by error-corretcing codes—on protocol efficiency are discussed. To quantitatively assess protocol performance, the protocol efficiency coefficient is introduced, defined as the ratio of the volume of payload data to ...
Added: December 1, 2025
Krouk E., Kabatiansky G. A., Sergeev A. et al., , in: 2024 International Scientific and Technical Conference Modern Computer Network Technologies (MoNeTeC).: IEEE, 2024. Ch. 11 P. 1–4.
At the center of the work – the method of decreasing the average message delay based on the error-correcting coding in the transport layer of the network model. The work estimates the gain of transport coding for of average and maximum latency reduction. The article starts with a detailed description of the theoretical network model ...
Added: December 12, 2024
Los A., Nesterenko A., Rogacheva O., В кн.: Алгебра, теория чисел, дискретная математика и многомасштабное моделирование: современные проблемы, приложения и проблемы истории. Материалы XXII Международной конференции, посвящённой 120-летию со дня рождения академика Андрея Николаевича Колмогорова и 60-летию со дня открытия школы-интерната № 18 при Московском университете.: [б.и.], 2023. С. 151–157.
One of the requirements for the quality of cryptographic algorithms is the equiprobable distribution of the characters of the sequence obtained after applying the cryptographic transformation. This requirement is due to the fact that in the presence of unequal probability of signs of the output sequence, it becomes possible to construct an effective method for ...
Added: April 24, 2024
Kirill Andreev, Ustinova D., Alexey Frolov, IEEE Wireless Communications Letters 2024 Vol. 13 No. 1 P. 69–73
We consider unsourced random access with MIMO receiver – a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel state information is unknown at transmitters and the receiver (no-CSI scenario). A comparison to the maximum-likelihood (ML) achievability bounds by Gao et al. ...
Added: January 22, 2024
Gromov V., Dang Q. N., , in: 10th International Conference, PReMI 2023, Kolkata, India, December 12–15, 2023, Proceedings. Pattern Recognition and Machine Intelligence. LNCS, volume 14301.: Cham: Springer, 2023. Ch. 3 P. 20–27.
Added: November 29, 2023
Kowshik S., Kirill Andreev, Frolov A. et al., IEEE Transactions on Communications 2020 Vol. 68 No. 8 P. 4694–4708
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding ...
Added: September 9, 2023
Glebov A., Rybin P., Kirill Andreev et al., IEEE Communications Letters 2023 Vol. 27 No. 9 P. 2313–2317
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We ...
Added: September 9, 2023