Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)

About Constructing Block Permutation LDPC Codes for Channels with Memory

Anna A. Fominykh, M. N. Isaeva, Andrei A. Ovchinnikov

Published May 31, 2021• 2 citations
Publisher

Abstract

This article examines constructing block-permutation low-density parity-check codes for error burst correction. Block-permutation constructions with superimposed zero masks are considered. We have analyzed the approach of construction such matrices consisting of two stages: finding the location of zero blocks and finding the base matrix. Experimental results containing analysis of correction capability of considered codes over the channel with memory are presented.

DOI
10.1109/weconf51603.2021.9470529

Related papers

About One Algorithm for Correcting Bursts Using Block-Permutation LDPC-Codes

Вересова Алина Максимовна, Andrei A. Ovchinnikov

The approaches to decoding block-permutation low-density parity-check codes in channels with memory are considered. The modification of windowed bit-flipping algorithm for bursty channels is proposed, which is guaranteed to correct bursts within the correcting capabilities of the code. The method of determining the position of bursts is proposed. The simulation results in a memory channel with a limit on the burst length are presented.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•Jun 1, 2019•19 citations

About Burst-Correction Capability of Block-Permutation LDPC Codes Ensembles

K. A. Bakay, Andrei A. Ovchinnikov, D. V. Ilina

The problem of maximal correctable error burst length estimation is considered for the probabilistic ensemble of block-permutation low-density parity-check codes. It is noted that this task has polynomial running time. For the number of probabilistic ensembles the simulations are performed showing that the correctable burst length grows linearly with the block size of the block-permutation construction, and with high probability equals to the block size minus one.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•Jun 1, 2019•3 citations

Burst Detection and Correction for Gilbert Codes and its QC-LDPC Extensions

Вересова Алина Максимовна, Andrei A. Ovchinnikov

The article discusses the issue of determining the location of an error burst based on the structure of a block-permutation low-density parity-check code. Quasi-cyclic low-density parity-check codes with a small number of blocks are considered, making it possible to correct the longest possible bursts within this construction. Through experimentation, the maximum, minimum, and average number of attempts was estimated when determining the start position of the error burst. The features of determining the location of a packet in block-permutation low-density parity-check codes are revealed. The proposed method is based on using majority decoding techniques and allows reducing the average number of attempts to locate a burst from hundreds to units for the codes under consideration. Using the packet detection method, which is based on the analysis of the structure of the parity-check matrix, algorithms for decoding Gilbert and extended Gilbert codes have been proposed, ensuring the correction of bursts within their error-correction capabilities. The process of decoding extended Gilbert codes utilizes list decoding in a supercode, with a criterion for selecting the error vector based on the syndrome.

International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)•Sep 30, 2024•2 citations

Modification Methods for Construction and Performance Analysis of Low-Density Parity-Check Codes over the Markov-Modulated Channels

Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa

We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.

•Jan 1, 2004•4 citations

About the peculiarities of searching for Information Sets of Block-Permutation LDPC-Codes when Correcting Error Bursts

M. N. Isaeva, Andrei A. Ovchinnikov

Modern communication standards use error-correcting coding, especially LDPC codes. Various algorithms are used to decode them, including decoding by information sets. The algorithm for decoding over information sets has exponential complexity. Errors may occur on any communication channel when transmitting messages. Traditionally, independent errors are considered when researching decoding algorithms. However, in real systems, errors are grouped into bursts. This article discusses the probability of detecting information sets while correcting error bursts. Random matrices and block permutation matrices are considered. Graphs of the dependence of the probability of finding information sets on the number of positions that are considered when searching for information sets are given.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•May 29, 2023•1 citation

Block interleaving algorithm for construction of low error floor LDPC codes

Jianhua Lü

A set of formulas were developed describe the probability of the minimum Hamming distance and the relationship between the bit error ratio and the minimum Hamming distance for low-density parity-check(LDPC) codes constructed with basic matrix expansion algorithm to analyze the error-floor problem.A block interleaving algorithm was given that permits sub-matrices to be superposed in the same location to construct low-error-floor LDPC codes.Simulation results demonstrate that compared with the basic matrix expansion algorithm,the proposed code construction algorithm alleviates the error-floor of an LDPC code from 10-7 to 10-9.

Journal of Tsinghua University(Science and Technology)•Jan 1, 2010•0 citations
This article examines constructing block-permutation low-density parity-check codes for error burst correction. Block-permutation constructions with superimposed zero masks are considered. We have analyzed the approach of construction such matrices consisting of two stages: finding the location of zero blocks and finding the base matrix. Experimental results containing analysis of correction capability of considered codes over the channel with memory are presented.
The article discusses the issue of determining the location of an error burst based on the structure of a block-permutation low-density parity-check code. Quasi-cyclic low-density parity-check codes with a small number of blocks are considered, making it possible to correct the longest possible bursts within this construction. Through experimentation, the maximum, minimum, and average number of attempts was estimated when determining the start position of the error burst. The features of determining the location of a packet in block-permutation low-density parity-check codes are revealed. The proposed method is based on using majority decoding techniques and allows reducing the average number of attempts to locate a burst from hundreds to units for the codes under consideration. Using the packet detection method, which is based on the analysis of the structure of the parity-check matrix, algorithms for decoding Gilbert and extended Gilbert codes have been proposed, ensuring the correction of bursts within their error-correction capabilities. The process of decoding extended Gilbert codes utilizes list decoding in a supercode, with a criterion for selecting the error vector based on the syndrome.
We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.
Modern communication standards use error-correcting coding, especially LDPC codes. Various algorithms are used to decode them, including decoding by information sets. The algorithm for decoding over information sets has exponential complexity. Errors may occur on any communication channel when transmitting messages. Traditionally, independent errors are considered when researching decoding algorithms. However, in real systems, errors are grouped into bursts. This article discusses the probability of detecting information sets while correcting error bursts. Random matrices and block permutation matrices are considered. Graphs of the dependence of the probability of finding information sets on the number of positions that are considered when searching for information sets are given.
A set of formulas were developed describe the probability of the minimum Hamming distance and the relationship between the bit error ratio and the minimum Hamming distance for low-density parity-check(LDPC) codes constructed with basic matrix expansion algorithm to analyze the error-floor problem.A block interleaving algorithm was given that permits sub-matrices to be superposed in the same location to construct low-error-floor LDPC codes.Simulation results demonstrate that compared with the basic matrix expansion algorithm,the proposed code construction algorithm alleviates the error-floor of an LDPC code from 10-7 to 10-9.