• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • A Two-Stage Decoding Based on Iterative Bounded Distance Approach
  • 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
April 28, 2026
Scientists Develop Algorithm for Accurate Financial Time Series Forecasting
Researchers at the HSE Faculty of Computer Science benchmarked more than 200,000 model configurations for predicting financial asset prices and realised volatility, showing that performance can be improved by filtering out noise at specific frequencies in advance. This technique increased accuracy in 65% of cases. The authors also developed their own algorithm, which achieves accuracy comparable to that of the best models while requiring less computational power. The study has been published in Applied Soft Computing.
April 27, 2026
Fair Division: How Mathematics Helps to Divide the Indivisible
How can items be allocated among participants so that no one feels short-changed? Alexander Karpov, Assistant Professor at the Faculty of Economic Sciences, and his Singaporean colleague, Prof. Warut Suksompong, set out to find a mathematical answer to this question. In this interview, they discuss how a model of rational preferences is constructed, why one cannot rely on a simple sum of values, and where an algorithm that asks a minimal number of questions can be useful.
April 24, 2026
Electronics of the Future: Why Superconductors and Spintronics Work Together
It was once believed that superconductivity and magnetism avoided each other like the devil avoids holy water. However, modern nanostructures prove the opposite. A Russian theoretical physicist and Indian experimentalists have joined forces to create the electronics of the future—free from energy losses. Nataliya Pugach, Professor at the School of Electronic Engineering at HSE MIEM and Leading Research Fellow at the Quantum Nanoelectronics Laboratory, explains how a long-standing acquaintance in Cambridge grew into a mirror laboratory project with the Indian Institute of Technology Bombay (IIT Bombay), how superconducting spintronics works, and what surprises a researcher in India beyond the university campus.

 

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

?

A Two-Stage Decoding Based on Iterative Bounded Distance Approach

P. 1–5.
A. A. Ovchinnikov, Fominykh A. A.

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 the same code redundancy. The proposed scheme combines the bounded distance decoding with an iterative decoding in two-stage manner. The main attention is paid to the analysis of the possibility of using such a decoder for decoding a BCH code in an AWGN channel. The expediency of using the second set of decoders is assessed. The analysis of influence of cycles on error probability is investigated.

Language: English
DOI
Keywords: iterative decodingBCH codesBounded distance decodingmultistage decodinghybrid decoding

In book

2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.
IEEE, 2022.
Similar publications
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
The discrete Fourier transform over the binary finite field
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 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
A spectral algorithm for decoding systematic BCH codes
Fedorenko Sergei Valentinovich, IEEE Access 2022 Vol. 10 P. 110639–110645
A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity. ...
Added: October 26, 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
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
Sergei Valentinovich Fedorenko, IEEE Access 2021 Vol. 9 P. 38673–38686
A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small complexity and allow matrix decomposition, as well as methods of adapting the truncated normalized cyclic convolutions calculation. For small values of ...
Added: April 15, 2021
Erasure correction by low-density codes
Zyablov V., Rybin P., Problems of Information Transmission 2009 Vol. 45 No. 3 P. 204–220
We generalize the method for computing the number of errors correctable by a low-density parity-check (LDPC) code in a binary symmetric channel, which was proposed by V.V. Zyablov and M.S. Pinsker in 1975. This method is for the first time applied for computing the fraction of guaranteed correctable erasures for an LDPC code with a ...
Added: December 11, 2017
Analysis of the relation between properties of LDPC codes and the tanner graph
Zyablov V., Rybin P., Problems of Information Transmission 2012 Vol. 48 No. 4 P. 297–323
A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical ...
Added: December 11, 2017
Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
Rybin P., Zyablov V., Problems of Information Transmission 2015 Vol. 51 No. 3 P. 205–216
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 ...
Added: December 11, 2017
Generalized Minimum Distance Decoder in a DHA FH OFDMA Employing Concatenated Coding
Subbotin A., Osipov D., , in: Multiple Access Communications. 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings.: Cham: Springer, 2016. P. 15–29.
In what follows a coded DHA FH OFDMA employing robust reception and concatenated coding construction is considered. The problem of employing Generalized Minimum Distance decoder as an outer code decoder is considered. The effectiveness of the proposed decision is verified by means of simulation. In particular performance of the communication system under intensive mixed interference ...
Added: January 4, 2017
  • 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