• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • On the Nested Family of LDPC Codes Based on Golomb Rulers
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 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
September 11, 2026
How to Assess Students Knowledge in the Age of AI
A researcher at HSE University has proposed a flowchart to help lecturers decide how to assess students who use artificial intelligence. It shows where the use of AI should be restricted and where it can be incorporated into the learning process. The article has been published in IT Professional.
September 9, 2026
‘Balkan Hospitality Opens Doors: Studying Dialects on the Verge of Extinction
You cannot study spoken dialects from books. Instead, you need to go to a village, seek out its elders, and earn the trust of local residents before you can record hours of spontaneous stories. This is how Natalia Muravleva, Associate Professor at the Faculty of Humanities, conducts her research. Her internship in Serbia continued her long-standing study of dialects spoken by Macedonian settlers. In this interview, she discusses how diaspora cultural centres help researchers reach informants, why native speakers need to be interviewed only in their own language (otherwise, as she puts it, they may 'break'), and how a single field season helped her finalise her monograph. She also shares warm memories of autumn in Belgrade and of colleagues with whom grammar can be discussed in three languages at once.
September 9, 2026
Scientists Train Neural Network to Generate Process Plans from 3D Models
Researchers at the HSE FCS AI and Digital Science Institute have developed CAD2TechSpec, a framework that converts 3D models of mechanical parts into machining process plans—step-by-step instructions for machine tools. The solution aims to reduce the time required for the design and preparation of technical process documentation in mechanical engineering, aircraft manufacturing, and other high-tech industries. The study findings have been published in PeerJ Computer Science.

 

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

?

On the Nested Family of LDPC Codes Based on Golomb Rulers

P. 67–71.
Ivanov F., Rybin P.

In this paper we present a new ensemble of Low- Density Parity-Check codes (LDPC Codes) based on modular Golomb rulers and permutation matrices. We suggest a designing rule for these codes that allows obtaining a nested family of LDPC codes with wide range of rates from one matrix of lowest rate code. Moreover, the regular way that we apply to construct our codes allows describing parity-check matrices with minimal number of parameters. The simulation results in the case of transmission via AWGN channel with QAM-4 modulation are presented.

Language: English
DOI
Text on another site
Keywords: LDPC codeМПП-кодGolomb Rulerлинейка Голомба

In book

Proceedings of 2017 VI-th International Conference on Engineering and Telecommunication (EnT) 29-30 Nov. 2017
IEEE Computer Society, 2017.
Similar publications
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
Уменьшение сложности моделирования сверхнизкого уровня ошибок LDPC кодов
Угловский А., Алексеев И., Щукин В. et al., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–11.
Одной из ключевых проблем МПП-кодов является оценка низкого уровня ошибок, возникающего при относительно высоком уровне отношения сигнал – шум (SNR). Данное явление обусловлено в основном замедленным декодированием таких особенных структур как Трэппинг Сет (Trapping Set, TS), которые даже при высоком SNR могут привести к ошибке декодера. Исследование и оценка сверхнизкого уровня ошибок являются важными и ...
Added: October 26, 2022
Уменьшение сложности декодера МПП кодов c параллельным расписанием построенных на базе Information Bottleneck
Мельников И., Kreshchuk A., Kureev A., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–8.
При использовании стандартного алгоритма декодирования кодов с малой плотностью проверок (МПП, англ.: Low-Density Parity-Check, LDPC) можно значительно уменьшить сложность декодирования за счёт хранения предвычисленной суммы всех сообщений в узлах переменных. Декодер Information Bottleneck (IB) значительно снизил пространственную сложность декодирования за счёт снижения разрядности всех сообщений. Для этого прямая сумма заменяется на локально оптимальную дискретную бинарную ...
Added: October 26, 2022
Построение и исследование грубоквантованного послоевого декодера с помощью информационного подхода
Курилов О. Ю., Гаев В., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–8.
Данная работа посвящена исследованию MinLUT декодера с различными видами квантования. В ходе исследования обнаружено, что с некоторого момента число итераций декодера играет незначительную роль в производительности декодера вне зависимости от вида квантования. Данная статья частично посвящена исследованию именно этого эффекта. ...
Added: October 26, 2022
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
On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel
Frolov A., Rybin P., Ivanov F., , in: Proceedings of the 2016 XV International Symposium «Problems of Redundancy in Information and Control Systems.: Institute of Electrical and Electronics Engineers ( IEEE ), 2016. P. 48–52.
Non-orthogonal multiple access schemes are of great interest for next generation wireless systems, as such schemes allow to reduce the total number of resources (frequencies or time slots) in comparison to orthogonal transmission (TDMA, FDMA, CDMA). In this paper we consider an iterative LDPC-based joint decoding scheme suggested in [1]. We investigate the most difficult ...
Added: October 4, 2018
Исследование корректирующих свойств кодов с малой плотностью проверок, основанных на кодах с повторением и матрицах перестановок
Ivanov F., В кн.: Сборник трудов 40-й междисциплинарной школа-конференции «Информационные технологии и системы 2016».: [б.и.], 2018.
В работе предложен новый ансамбль двоичных кодов с малой плотностью проверок на четность, основанный на кодах с повторением и матрицах перестановок. Для построенного ансамбля получены оценки на минимальное расстояние. Представлены результаты моделирования предложенных кодовых конструкций для итеративного алгоритма декодирования "распространения доверия" (Sum-Product) при передаче кодового слова с помощью двоичной фазовой манипуляции по каналу с аддитивным ...
Added: October 4, 2018
Сборник трудов 40-й междисциплинарной школа-конференции «Информационные технологии и системы 2016»
[б.и.], 2018.
«Информационные технологии и системы» (ИТиС) – междисциплинарная школа-конференция Института проблем передачи информации им. А. А. Харкевича Российской академии наук (ИППИ РАН). Она зародилась в далеком 1966 году как ежегодная конференция молодых ученых Института. Прерванная в трудные 90-ые, традиция была возобновлена в 2007 году и с тех пор вышла далеко за пределы ИППИ РАН, каждый год собирая на ...
Added: October 4, 2018
Оценка экспоненты вероятности ошибки для регулярных, основанных на графах МПП-кодов с конечной длиной
Rybin P., Ivanov F., Информационные процессы 2017 Т. 17 № 4 С. 284–293
This paper deals with 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). Unlike other papers where error exponents are considered for the case when the length of LDPC codes tends to infinity (asymptotic analysis) we considered the finite ...
Added: October 4, 2018
Vectorization of Computations in Decoding of Non-Binary Low-Density Parity-Check Codes
Ivanov F., Zhilin I., Automation and Remote Control 2016 Vol. 77 No. 10 P. 1781–1791
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant speedup of modeling. ...
Added: October 3, 2018
Специальный класс квазициклических кодов с малой плотностью проверок на основе кодов с повторением и матриц перестановок
Ivanov F., Проблемы передачи информации 2017 Т. 53 № 3 С. 30–43
We propose a new ensemble of binary low-density parity-check codes with paritycheck matrices based on repetition codes and permutation matrices. The proposed class of codes is a subensemble of quasi-cyclic codes. For the constructed ensemble, we obtain minimum distance estimates. We present simulation results for the proposed code constructions under the (Sum-Product) iterative decoding algorithm ...
Added: February 1, 2018
Коды с малой плотностью проверок, основанные на полях Галуа
Ivanov F., Zyablov V., Потапов В. Г., Информационные процессы 2012 Т. 12 № 1 С. 68–83
Methods for constructing a mapping of the elements of a multiplicative group of a Galois field onto a symmetric group of permutation matrices are proposed. A technique minimizing the order of the symmetric group is suggested. The results are used for constructing an ensemble of low-density parity-check codes. The obtained code constructions are tested on ...
Added: December 11, 2017
Векторизация вычислений при декодировании недвоичных кодов с малой плотностью проверок
Ivanov F., Zhilin I., Автоматика и телемеханика 2016 Т. 10 С. 109–122
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant ...
Added: December 11, 2017
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
Коды с малой плотностью проверок, основанные на системах Штейнера и матрицах перестановок
Ivanov F., Зяблов В. В., Проблемы передачи информации 2013 Т. 49 № 4 С. 41–56
An algorithm for generating parity-check matrices of regular low-density paritycheck codes based on permutation matrices and Steiner triple systems S(v, 3, 2), v = 2m − 1, is proposed. Estimations of the rate, minimum distance, and girth for obtained code constructions are presented. Results of simulation of the obtained code constructions for an iterative “belief propagation” (Sum-Product) decoding algorithm ...
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
  • 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