?
Оценка перемежения и учёта памяти при декодировании низкоплотностных кодов в канале Гилберта-Эллиота
Вопросы радиоэлектроники. Серия: Техника телевидения. 2022. № 3. С. 125–133.
Ovchinnikov A., Фоминых А. А.
Language:
Russian
Kulev Y., Maksaev A., Promyslov V., Linear Algebra and its Applications 2026 Vol. 730 P. 51–72
The notion of λ-th upper scrambling index was introduced by Huang and Liu in 2010, as a generalization of a notion considered by Akelbek and Kirkland in 2009. For a primitive digraph D, it is defined as the smallest positive integer k such that for every λ vertices of D there exist directed paths of lengths k from these vertices to a common vertex. This ...
Added: August 7, 2026
Kanunnikov A., Promyslov V., Vassilieva E., Electronic Journal of Combinatorics 2024 Vol. 31 No. 3 Article P3.6
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the b-conjecture) are two major open questions relating Jack symmetric functions, the representation theory of the symmetric groups and combinatorial maps. They show that the coefficients in the power sum expansion of some Cauchy sum for ...
Added: August 7, 2026
Фирсанова В. И., ACM, 2026.
The inclusion of autistic people can be augmented by a mobile app that provides information without a human mediator making information perception more liberating for people in the spectrum. This paper is an overview of a doctoral work dedicated to the development of a web-based mobile tool for supporting the inclusion of people on the ...
Added: August 4, 2026
Фирсанова В. И., Хлусова Я. К., CEUR Workshop Proceedings, 2025.
Knowledge graphs are widely used in Retrieval Augmented Generation (RAG) and Explainable AI (XAI), since they can illustrate semantic relationships generated by Large Language Models (LLMs). Recent studies focus on generating knowledge graphs from unstructured data to improve RAG performance; however, they do not explain the underlying graph structure. The analysis of synthetic graphs behind ...
Added: August 4, 2026
Spiridonov V. P., Belousov N. M., Sarkissian G. A., Analysis and Mathematical Physics 2026 Vol. 16 Article 96
Hyperbolic hypergeometric integrals are defined as Barnes-type integrals of products of hyperbolic gamma functions. Their reduction to ordinary hypergeometric functions is well known. We study in detail their degeneration to complex hypergeometric functions. Namely, using uniform bounds on the integrands, we prove that the univariate hyperbolic beta integral and the conical function degenerate to two-dimensional ...
Added: August 4, 2026
Gayfullin S., Kikteva V., Results in Mathematics 2026 Vol. 81 No. 5 Article 146
In this paper we obtain a criterion of flexibility for an affine complexity-zero horospherical variety. This result generalizes previously known results on flexibility of normal horospherical varieties, horospherical varieties with an action of a semisimple group, and non-normal toric varieties. ...
Added: August 3, 2026
Lunts V., Функциональный анализ и его приложения 2026 Т. 60 № 3 С. 127–129
Доказано, что канонические полуортогональные разложения производной категории диаграммной схемы индуцируют аналогичные разложения подкатегории совершенных комплексов. ...
Added: August 3, 2026
Belomestny D., Gasnikov A., Gladin E. et al., Russian Mathematical Surveys 2026 Vol. 81 No. 4(490) P. 3–90
Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and the Bellman operators, emphasizing contraction mappings, monotonicity, and fixed-point theory that yield convergence guarantees and rates ...
Added: August 3, 2026
Chepovskiy A., Мастерская Печати Идей, 2026.
The textbook presents methods and algoгithms for automatic analysis
of соrроrа of texts in natural languages. It is intended fоr sfudenБ of
methods of processing texts in паtчrаl languages and creating training
arays of texts.
Fоr students, graduate students and researchers studying methods
of computational linguistics and word processing. ...
Added: August 1, 2026
A. Radomskii, Mathematical notes 2026 Vol. 119 No. 6 P. 1136–1147
We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in\mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some restrictions. As applications, for any $t>0$, we obtain an upper bound for the number of $n\in [1,N]$ such that $a_{n}/ \varphi (a_{n})> t$. ...
Added: July 31, 2026
Абызов А. Н., Буутай П. Н., Математика и теоретические компьютерные науки 2026 Т. 4 № 2 С. 4–75
This paper is expository and methodological in nature and is devoted to the development of E.I. Zolotarev’s ideas embedded in his approach to the proof of the quadratic reciprocity law (1872). We consider extensions of Zolotarev’s approach to abstract number rings presented in the work of A. Brunyate and P.L. Clark (2015), and to finite ...
Added: July 30, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Уилкокс П., Romanov A., М.: ДМК Пресс, 2025.
Книга, которую вы держите в руках, продолжает серию «Книжная полка истового
инженера», которая издается при поддержке компании YADRO.
Данная книга представляет собой учебник по теоретическим основам продвинутой
функциональной верификации и содержит лучшие практики, используемые в настоящее
время. В ней подробно описана унифицированная методология верификации
(UVM) и раскрыты такие темы, как функциональный виртуальный прототип, функциональное
покрытие, утверждения, формальная верификация, тестбенчи, косимуляция,
эмуляция, аппаратное ...
Added: July 30, 2026
Mikhaylets E. V., Razorenova A. М., Chernyshev V. L. et al., Scientific Reports 2026 Vol. 16 Article 23560
Meditation offers a naturalistic paradigm for studying introspection, yet the neural dynamics of advanced tantric practices remain largely unexplored. Buddhist Highest Yoga Tantra (BHYT) comprises a sequence of eight dissolution stages culminating in the “clear light” state. We recorded EEG during eyes-closed BHYT meditation performed in monasteries and hermitages (51 sessions from 36 male practitioners; ...
Added: July 29, 2026
Попеленский Ф. Ю., Математический сборник 2026 Т. 217 № 2 С. 108–153
In a recent paper Buchstaber and the author introduced a new structure on the cohomology of Hopf algebras in terms of the Buchstaber spectral sequence (Bss). We fully calculate this structure on the cohomology (known for a long time) of the important Hopf subalgebra A(1) of the classical Steenrod algebra A2.
As part of a demonstration ...
Added: July 28, 2026
Metlov K., Andrei B. Bogatyrëv, Annalen der Physik 2026 Vol. 538 No. 6 Article e70234
Thanks to the recent progress in bulk full three-dimensional nanoscale magnetization distribution imaging, there is a growing
interest to three-dimensional (3D) magnetization textures, promising new high information density spintronic applications.
Compared to 1D domain walls or 2D magnetic vortices/skyrmions, they are a much harder challenge to represent, analyze and
reason about. Here we build analytical representation for such ...
Added: July 28, 2026
Исаева М. Н., Научно-технический вестник информационных технологий, механики и оптики 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
Исаева М. Н., Ovchinnikov A., Научно-технический вестник информационных технологий, механики и оптики 2024 Т. 24 № 1 С. 70–80
The most important method of ensuring data integrity is correcting errors that occur during information storage,
processing or transmission. The error-correcting coding methods are used to correct errors. In real systems, noise
processes are correlated. However, traditional coding and decoding methods use decorrelation, and it is known that
this procedure reduces the maximum achievable characteristics of coding. Thus, ...
Added: March 4, 2024
Исаева М. Н., T-Comm: Телекоммуникации и транспорт 2023 Т. 17 № 7 С. 4–12
В данной статье рассматривается вопрос об оценке вероятности нахождения информационных совокупностях в матрицах блочно-перестановочного и блочно-циркулянтного вида. Традиционно в помехоустойчивом кодировании рассматриваются независимые ошибки, однако, в реальных системах они могут быть сгруппированы и образовывать, так называемый, пакет ошибок. Известные оценки вероятности нахождения информационной совокупности проводятся для случайных матриц, а для исправления пакетов ошибок могут использоваться ...
Added: July 17, 2023
А. А. Овчинников, А. М. Вересова, В кн.: Обработка, передача и защита информации в компьютерных системах '22. Сборник докладов Второй Международной научной конференции. Санкт-Петербург, 2022.: СПб.: Санкт-Петербургский государственный университет аэрокосмического приборостроения, 2022. С. 277–281.
При анализе и разработке криптосистем с открытым ключом большое внимание уделяется оптимизации
размера ключей и стойкости. Однако информационная избыточность в таких системах также является
важной характеристикой. В статье рассматривается вопрос оценки параметров системы, основанной на
декодировании пакетов ошибок, при уменьшении избыточности. ...
Added: October 27, 2022