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 Burst-Correction Capability of Block-Permutation LDPC Codes Ensembles

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

Published Jun 1, 2019• 3 citations
Publisher

Abstract

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.

DOI
10.1109/weconf.2019.8840134

Related papers

On the error-correcting capability of LDPC codes

Kamil Sh. Zigangirov, A. E. Pusane, D. K. Zigangirov +1 more

We consider the ensemble of low-density parity-check (LDPC) codes introduced by Gallager [1]. The Zyablov-Pinsker majority-logic iterative algorithm [2] for decoding LDPC codes is analyzed on the binary symmetric channel. An analytical lower bound on the error-correcting capability τ max that grows linearly in the code block length is obtained.

Problems of Information Transmission•Sep 1, 2008•11 citations

About Constructing Block Permutation LDPC Codes for Channels with Memory

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

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.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•May 31, 2021•2 citations

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

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

Optimizing burst erasure correction of LDPC codes by interleaving

Gokul Sridharan, Abishek Kumarasubramanian, Andrew Thangaraj +1 more

The performance of iterative decoding of low density parity check (LDPC) codes over binary erasure channels can be completely characterized by the study of stopping sets. Therefore, the burst erasure correction capability of a given LDPC code can be readily quantified by searching for stopping sets within consecutive bit nodes. In this work we study the optimal permutation of the bit nodes that will result in the maximum possible burst erasure correction capability for a given LDPC code. Noting that this is essentially a combinatorial optimization problem that is highly likely to be NP-hard, we adopt a simulated annealing based approach for finding the optimal permutation. We present bounds based on stopping sets that limit the burst erasure correction capability. As part of our results, we provide interleavers that greatly improve the burst erasure correction capability of protograph quasi-cyclic LDPC codes used in the WiMax standard.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•8 citations

The polynomial error probability for LDPC codes

Jort van Mourik, Yoshiyuki Kabashima

We obtain exact expressions for the asymptotic behaviour of the average probability of the block decoding error for ensembles of regular low density parity check error correcting codes, by employing diagrammatic techniques. Furthermore, we show how imposing simple constraints on the code ensemble (that can be practically implemented in linear time), allows one to suppress the error probability for codes with more than 2 checks per bit, to an arbitrarily low power of $N$. As such we provide a practical route to a (sub-optimal){\em expurgated} ensemble.

arXiv:cond-mat/0310177•Oct 8, 2003•4 citations
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.
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.
The performance of iterative decoding of low density parity check (LDPC) codes over binary erasure channels can be completely characterized by the study of stopping sets. Therefore, the burst erasure correction capability of a given LDPC code can be readily quantified by searching for stopping sets within consecutive bit nodes. In this work we study the optimal permutation of the bit nodes that will result in the maximum possible burst erasure correction capability for a given LDPC code. Noting that this is essentially a combinatorial optimization problem that is highly likely to be NP-hard, we adopt a simulated annealing based approach for finding the optimal permutation. We present bounds based on stopping sets that limit the burst erasure correction capability. As part of our results, we provide interleavers that greatly improve the burst erasure correction capability of protograph quasi-cyclic LDPC codes used in the WiMax standard.
We obtain exact expressions for the asymptotic behaviour of the average probability of the block decoding error for ensembles of regular low density parity check error correcting codes, by employing diagrammatic techniques. Furthermore, we show how imposing simple constraints on the code ensemble (that can be practically implemented in linear time), allows one to suppress the error probability for codes with more than 2 checks per bit, to an arbitrarily low power of NNN. As such we provide a practical route to a (sub-optimal){\em expurgated} ensemble.