Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

?

Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

Problems of Information Transmission. 2015. Vol. 51. No. 3. P. 205–216.

Rybin P., Zyablov V.

Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of a generalized LDPC code with a special construction is proposed. The error exponent lower bound for the modified decoding algorithm is obtained. Finally, numerical results for the considered error exponent lower bounds are presented and analyzed.

Research target: Mathematics Computer Science Electronics and Electrical Engineering

Priority areas: IT and mathematics mathematics

Language: English

DOI

Text on another site

On structural stability of 3-diffeomorphisms with the Smale solenoid attractor–repeller dynamics

Medvedev T. V., Pochinka O., Chaos 2026 Vol. 36 No. 6 Article 063107

We consider 3-diffeomorphisms with source–sink dynamics where Smale solenoids play the role of the source and the sink (NSSS-diffeomorphisms). It is known that such diffeomorphisms exist only on lens spaces. On the 3-sphere, every NSSS-diffeomorphism is associated with an exchangeable braid. An exchangeable braid with the strand number n was constructed for each n 3 in such a way ...

Added: June 4, 2026

Proceedings of the 43rd International Conference on Machine Learning (ICML 2026)

Seul: PMLR, 2026.

Added: June 4, 2026

Об эквивалентности по надстройке декартовых произведений регулярных гомеоморфизмов с гомеоморфизмами Данжуа

Nozdrinova E., Pochinka O., Shmukler V., Математический сборник 2026 Т. 217 № 6 С. 71–89

Гомеоморфизмы топологических пространств называются эквивалентными по надстройке, если надстройки над ними топологически эквивалентны. В частности, топологически сопряженные гомеоморфизмы эквивалентны по надстройке. Известно, что для гомологически неприводимых гомеоморфизмов их топологическая сопряженность является необходимым и достаточным условием их эквивалентности по надстройке. Тогда как инварианты топологической сопряженности гомологически приводимых гомеоморфизмов во многих случаях являются избыточными для эквивалентности по ...

Added: June 3, 2026

Случайные блуждания на симметрических пространствах некомпактного типа ранга 1

Gnetov F., Konakov V., Успехи математических наук 2026 Т. 81 № 3 (489) С. 161–162

Пусть M обозначает симметрическое пространство некомпактного типа ранга 1. Опираясь на фундаментальную работу [1], в [2] было показано, что плотность соответствующим образом нормированной суммы независимых Hn-значных случайных величин, определенная через сложение Мёбиуса в модели шара Пуанкаре, сходится к фундаментальному решению соответствующего уравнения теплопроводности. Пределом являлся нормальный закон на Hn, соответствующий ядру теплопроводности, определяемому оператором Лапласа–Бельтрами. ...

Added: June 2, 2026

OpenAtom Foundation. Консорциум, развивающий Open Source в Китае.

Silakov D., Системный администратор 2026 № 3 С. 28–33

В статье про платформы для разработки открытого ПО в Китае мы рассказали про GitCode – молодой проект, позиционируемый как площадка для разработчиков со всего мира. Сейчас на GitCode размещаются проекты, созданные в КНР, но некоторые из них уже известны и на международной арене. Помочь открытым проектам в становлении, развитии и расширению аудитории призван фонд OpenAtom ...

Added: June 2, 2026

The recognition-by-components method

Slivnitsin P., Mylnikov L., Engineering Applications of Artificial Intelligence 2026 Vol. 179 Article 115185

The paper describes a applied artificial intelligence task of recognition-by-components method of real objects based on the recognition of a limited set of primitives or components. The recognition-by-components makes it possible to determine the components, that compose an object, and increase the number of recognizable objects without degrading the recognition quality. Training is performed on ...

Added: May 29, 2026

Electrical networks and data analysis in phylogenetics

Gorbounov Vassily, Kazakov A., Data Analytics and Topology 2025 Vol. 1 No. 1 P. 33–45

A classic problem in data analysis is studying the systems of subsets defined by either a similarity or a dissimilarity function on X which is either observed directly or derived from a data set. For an electrical network there are two functions on the set of the nodes defined by the resistance matrix and the response ...

Added: May 28, 2026

Brain-Computer Interfaces for Gait Rehabilitation After Stroke A Scoping Review

Mokienko O., Zisman M. A., Bobrov P. et al., American Journal of Physical Medicine and Rehabilitation 2026 Vol. 105 No. 6 P. 555–563

Brain-computer interfaces (BCIs) represent a promising technology for restoring lower limb motor functions and gait after stroke. The application of BCIs in this field is supported by a limited number of studies. The objective of the review was to systematically and critically evaluate the current evidence on the use of BCIs for lower limb function ...

Added: May 28, 2026

Электростатически управляемый контроль диссипации в двумерном наноэлектромеханическом резонаторе через напряжение-амплитудный антагонизм с рекордной 928% подстройкой добротности.

Arutyunov K., JIANG1 Q., FANG J. et al., Science China Information Sciences 2026 Vol. 69 No. 6 P. 1–11

Resonators based on nanoelectromechanical systems (NEMS) using two-dimensional (2D) materials with high-quality factors and excellent electrical control are critical for tunable coherent phonon dynamics, resonant sensors and wireless communications. However, their performance is fundamentally limited by the lack of a unified framework governing energy dissipation mechanisms and their electrical tunability. Here, we synergistically modulate both ...

Added: May 28, 2026

ML-based Fast Simulation of FARICH Responses

Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.

A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...

Added: May 19, 2026

Bifurcations and Structural Stability of Generic PC-HC Families

Dorovskiy A., / Series arXiv "math". 2026.

In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...

Added: May 14, 2026

On the minimum number of maximal distance-k independent sets in trees

Taletskii D., / Series arXiv "math". 2026.

A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...

Added: May 1, 2026

On Arithmetic Mirror Symmetry for smooth Fano fourfolds

Ovcharenko M., / Series arXiv "math". 2026.

We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...

Added: April 30, 2026

Natural hazard database from Internet publications: text mining with a large language model

Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.

Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...

Added: April 28, 2026

Algorithmic overlaps as thermodynamic variables: from local to cluster Monte Carlo dynamics in critical phenomena

Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.

We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...

Added: April 20, 2026

On weak solutions to the 1d compressible Navier-Stokes equations: a Lipschitz continuous dependence on data in weaker norms and an error of their homogenization

Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.

We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...

Added: April 18, 2026

On the dimension of the space of static potentials on three-manifolds

Medvedev V., / Series arXiv "math". 2026.

We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...

Added: April 3, 2026

Using predefined vector systems to speed up neural network multimillion class classification

Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.

Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...

Added: April 2, 2026

Homogeneous maximizers of the Blaschke-Santalo-type functionals

Kolesnikov A., / Series arXiv "math". 2025.

We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets. We also discuss links to the ...

Added: February 13, 2026

Iterative Ricci-Foster Curvature Flow with GMM-Based Edge Pruning: A Novel Approach to Community Detection

Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.

Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...

Added: January 15, 2026

Energy efficient coded random access for the wireless uplink

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

Evaluation of Error Probability of Iterative Schemes for Channels with Memory

Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–5.

The common technique to perform decoding in channels with memory is to use interleaving, which increases both complexity and delay at the receiver. To overcome these limitations, coding scheme adaptation approaches might be used. One of the approaches is the optimization of long error-correcting codes and the modification of the decoder, taking into account the ...

Added: July 18, 2023

Comparison of different coding schemes for 1-bit ADC

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

Delay Analysis of Massive Unsourced ALOHA-based Protocols with User Authentication

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