• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • About Burst Decoding for Block-Permutation LDPC Codes
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
May 25, 2026
HSE Scientists Train Neural Network to 'Hear' Faults in Electric Motors
Researchers at the AI and Digital Science Institute of the HSE Faculty of Computer Science have developed a new method—the Signature-Guided Data Augmentation (SGDA) framework—that achieves 99% accuracy in motor fault detection and 86% accuracy in fault classification. The application of this approach can reduce industrial equipment repair costs, minimise downtime, and improve production safety. The study results have been published in Engineering Applications of Artificial Intelligence.
May 25, 2026
'The Humanities Serve as a Conscience'
Maria Mizernaia studies Soviet literature and the history of book publishing. In this interview for the HSE Young Scientists project, she discusses plans to publish a novel about besieged Leningrad, AI-provoked reflections on what it means to be human, and how novels can help satisfy our dopamine hunger.
May 25, 2026
Is It Possible to Predict a Citys Life Based on the Shape of Its Neighbourhoods?
Is it possible to predict, based on the configuration of streets and buildings, where a café will open or where traffic congestion will occur? Participants in the Spatial Analysis and Modelling of Urban Processes research and study group use open data and machine learning to identify universal patterns. Alexander Sheludkov and Eduard Somov discuss the purpose of comparing cities, the need for new forms of urban statistics, and how open data is transforming approaches to urban studies.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

About Burst Decoding for Block-Permutation LDPC Codes

P. 393–401.
Andrei Ovchinnikov, Fominykh A.

Hard-decision decoders are considered for burst error correction for low-density parity-check codes. The decoder for block-permutation construction of low-density parity-check proposed. Experiments on complexity and error probability are conducted with burst lengths both within and beyond the burst error correction capability. Also simulation results for Gilbert model are presented.

Language: English
DOI
Keywords: LDPC codeschannels with memoryBurst-error correcting codes

In book

Internet of Things, Smart Spaces, and Next Generation Networks and Systems. 20th International Conference, NEW2AN 2020, and 13th Conference, ruSMART 2020, St. Petersburg, Russia, August 26–28, 2020, Proceedings, Part I
Issue 12525. , Springer, 2020.
Similar publications
Sampling Rate Optimization for LDPC-Based Information Reconciliation Protocol in QKD
Morozov V., Oleg Evsutin, Nikita Yarygin, , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–7.
Quantum Key Distribution (QKD) is a promising field in modern cryptography where the security of key information is guaranteed by the laws of quantum mechanics. One of the key stages in QKD protocols is error estimation and reconciliation in the secret key. This procedure requires the transmission of a certain number of secret key bits ...
Added: December 30, 2025
Estimation of MAP component decoding of product codes in two-state channels
Ovchinnikov A., Fominykh A., , in: Распределённые компьютерные и телекоммуникационные сети: управление, вычисление, связь (DCCN-2023).: -, 2023. P. 101–106.
Product code construction is a powerful error-correcting tool for both channels with and without memory. The common approach to decoding product (iterative) code is to apply consequent decoders in a sequential manner. The paper examines the influence of memory in the channel on iterative decoding for hard decision, soft decision, and trellis-based decoding algorithms. Also, ...
Added: December 18, 2025
Construction of LDPC Codes for Single Bursts Correction by Masking
Veresova A., Ovchinnikov A., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–5.
This paper addresses the problem of constructing codes for correcting single error bursts. The construction is based on a block-circulant design of low-density parity-check codes. For such a design, the maximal correctable burst length is limited by the block size, which forces consideration of codes whose parity-check matrix contains only a small number of large blocks. However, this significantly restricts the ...
Added: November 24, 2025
Построение множества плотных информационных совокупностей для кодов Гилберта и их расширений
Исаева М. Н., Научно-технический вестник информационных технологий, механики и оптики 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
Численная оптимизация проверочной матрицы LDPC-кода для применения в протоколе квантового распределения ключей с использованием высокопараллельных вычислений
Morozov V., Башара В. О., Емельяненко М. В., В кн.: Параллельные вычислительные технологии – XIX всероссийская научная конференция с международным участием, ПаВТ’2025, г. Москва, 8–10 апреля 2025 г. Короткие статьи и описания плакатов.: Челябинск: Издательский центр ЮУрГУ, 2025. С. 193–210.
Error correction in the secret key is a mandatory step in quantum key distribution (QKD) protocols. Usually, modern error-correcting codes are used for its implementation. Imperfections of the hardware used in QKD systems lead to bit flipping errors in the channel. Moreover, such systems are characterized by an asymmetric distribution of such errors. Taking into ...
Added: June 3, 2025
Usage of polar codes for fixed and random length error bursts correction
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
Burst Detection and Correction for Gilbert Codes and its QC-LDPC Extensions
Veresova A., Ovchinnikov A., , in: 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Novosibirsk: IEEE, 2024. P. 47–51.
Added: November 27, 2024
On the Comparison of Different Serial Concatenated Schemes Based on Polar and LDPC Codes
Ivanov F., Kuvshinov A., Facta Universitatis. Series Electronics and Energetics 2024 Vol. 37 No. 3 P. 483–496
Nowadays concatenated codes are actively developed for different applications of error-correcting theory. In this paper we propose a new method for constructing concatenated codes consisting of some outer error-correcting code and a particular designed inner low-density parity-check (LDPC) code. We consider polarization-adjusted convolutional (PAC) code and LDPC code as outer code of suggested construction. Special ...
Added: November 16, 2024
ПРОБЛЕМЫ СОЗДАНИЯ СИСТЕМ КВАНТОВОГО РАСПРЕДЕЛЕНИЯ КЛЮЧЕЙ ДЛЯ МАГИСТРАЛЬНЫХ ЛИНИЙ БОЛЬШОЙ ПРОТЯЖЕННОСТИ
Nefedov S., Ozhegov R., Evsyutin O. et al., Наноиндустрия 2024 Т. 17 № S10-2 (128) С. 553–558
The paper considers challenges of creating a quantum key distribution system for long-distance trunk line. Besides, it presents the results of design, prototyping and examination of equipment implementing the quantum key distribution protocol with phase-time coding. ...
Added: August 2, 2024
On the Serial Concatenation of LDPC Codes
Ivanov F., Kuvshinov A., , in: 2023 16th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).: Niš: IEEE, 2023. P. 228–231.
Concatenated codes are effectively used in different approaches of error-correcting theory. We suggest new concatenated code construction that is composed of outer LDPC code and a particular designed inner LDPC code. Special optimization procedure was developed to obtain inner code with specific error-correcting characteristics. We apply the decoder of woven codes to this construction, while ...
Added: June 21, 2024
On the woven-like concatenation of LDPC codes
Ivanov F., Kuvshinov A., , in: 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).: Ekaterinburg: IEEE, 2022. P. 190–194.
In this paper we consider the special construction of concatenated codes. Our scheme consists of outer LDPC code and a specially designed class of inner LDPC code with interleaver between inner and outer codes. An inner code in the proposed construction is obtained using a specific optimization algorithm that allows to minimize SNR for a ...
Added: June 21, 2024
Decoding of Product Codes in Discrete and Semi-continuous Channels with Memory
Fominykh A., Ovchinnikov A., , in: Distributed Computer and Communication Networks: Control, Computation, Communications: 26th International Conference, DCCN 2023, Moscow, Russia, September 25–29, 2023, Revised Selected Papers.: Switzerland: Springer, 2023. P. 478–489.
Product code construction is a powerful error-correcting tool for both channels with and without memory. The common approach to decoding product codes is to apply consequent decoders in a sequential manner. The paper examines the influence of memory in the channel on iterative decoding for hard decision, soft decision, and trellis-based decoding algorithms. Also, the ...
Added: October 31, 2023
About the Joint Correcting of Error Bursts and Independent Errors Using LDPC Codes
Veresova A., Ovchinnikov A., , in: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).: IEEE, 2023. P. 122–126.
This article discusses the application of low-density parity-check (LDPC) codes for error correction, with a focus on the joint correction of both grouped and independent errors in communication and data storage systems. The error correction capabilities of LDPC codes with different constructions were estimated when correcting single error bursts and independent errors. Experiments showed that correcting even ...
Added: October 30, 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
Comparative Analysis of Polar and LDPC Codes in Space and Satellite Communication Systems
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
Decoding of linear codes for single error bursts correction based on the determination of certain events
А. А. Ovchinnikov, А. М. Veresova, Fominykh A. A., Информационно-управляющие системы 2022 No. 6 P. 41–52
In modern systems for communication, data storage and processing the error-correction capability of codes are estimated for memoryless channels. In real channels the noise is correlated, which leads to grouping error in bursts. A traditional method to fight this phenomenon is channel decorrelation, which does not allow developing of coding schemes, mostly utilizing the channel ...
Added: June 22, 2023
Usage of LDPC codes in a Gilbert channel
Ovchinnikov A., A. Veresova, Fominykh A. A., Proceedings of Telecommunication Universities 2022 Vol. 8 No. 4 P. 55–63
Although low-density parity-check (LDPC) codes in modern communication standards have been extensively studied over a memoryless channel, their burst error correction capacity in channels with memory has yet to be thoroughly analyzed. The conventional approach to transmission in channels with memory uses interleaving within a buffer of several codewords. However, such an approach reduces the efficiency of ...
Added: June 22, 2023
About Using Matched Metrics in Channels with Memory for Gilbert Codes
A. M. Veresova, A. A. Ovchinnikov, , in: 2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2020. P. 1–4.
The main concepts of the metric description of memory channels are considered, as well as a specific metric for such channels. The spectral properties of the Gilbert code in relation to the Markov metric are analyzed. It is shown that using a matched metric increases the efficiency of channel usage. ...
Added: October 30, 2022
About Usage of Metrics in Decoding of LDPC Codes in Two-State Channels with Memory
Alina M. Veresova, Fominykh A. A., Andrei A. Ovchinnikov, , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 143–148.
The applying of low-density parity-check codes is considered over two-state channels with memory described by Markov and Gilbert models. The error probability using different strategies of syndrome decoding is estimated. The method of choosing the coset leaders is proposed which provides the error probability close to maximum-likelihood decoding for the considered codes. ...
Added: October 27, 2022
Comparison of the Probability of Reed – Solomon and LDPC Codes Decoding Error in the Gilbert – Elliott Channel
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
On the Secret Sharing Scheme Based on Supercodes Decoding
Ivanov F., Alexey Kreschuk, Krouk E., , in: 21th IFAC World CongressVol. 53. Issue 2.: Elsevier, 2020. P. 11108–11113.
Secret sharing schemes have been studied intensively for the last 20 years, and these schemes have a number of real-world applications. There are a number of approaches to the construction of secret sharing schemes. One of them is based on codes of forward error correction (FEC). In fact, every linear code can be used to ...
Added: October 20, 2021
On Estimation of the Error Exponent for Finite Length Regular Graph-Based LDPC Codes
Rybin P., Ivanov F., Journal of Communications Technology and Electronics 2018 Vol. 63 No. 12 P. 1518–1523
The error exponent of the regular graph-based binary low-density parity-check (LDPC) codes under the maximum likelihood (ML) decoding algorithm in the binary symmetric channel (BSC) is analyzed. Unlike most other papers where error exponents are considered for the case when the length of LDPC codes tends to infinity (asymptotic analysis), the finite length case (finite ...
Added: March 1, 2019
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit