About Burst-Correction Capability of Block-Permutation LDPC Codes Ensembles
K. A. Bakay, Andrei A. Ovchinnikov, D. V. Ilina · 2019 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) · 2019
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.