A Lower Bound for Codes Correcting Low Density Closed-Loop Burst
نویسنده
چکیده
In this paper, we present a lower bound for low density closed loop burst error correcting code in two sub-blocks of length 1 n and 2 n of the total code length 1 2 ( ) n n n n . Keywords-Open loop burst, Closed loop burst, Parity check matrix,Syndromes, Error correction.
منابع مشابه
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we ...
متن کاملBlockwise Solid Burst Error Correcting Codes
This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.
متن کاملOn 2-Repeated Burst Codes
There are several kinds of burst errors for which error detecting and error correcting codes have been constructed. In this paper, we consider a new kind of burst error which will be termed as ‘2-repeated burst error of length b(fixed)’. Linear codes capable of detecting such errors have been studied. Further, codes capable of detecting and simultaneously correcting such errors have also been d...
متن کاملCodes for Correcting a Burst of Deletions or Insertions
This paper studies codes which correct bursts of deletions. Namely, a binary code will be called a b-burst-correcting code if it can correct a deletion of any b consecutive bits. While the lower bound on the redundancy of such codes was shown by Levenshtein to be asymptotically log(n) + b− 1, the redundancy of the best code construction by Cheng et al. is b(log(n/b+1)). In this paper, we close ...
متن کاملOn the Theory of Low - Density
We introduce and analyze a new statistical ensemble of low-density parity-check convolutional (LDC) codes. The result of the analysis are bounds, such as a lower bound for the free distance and upper bounds for the burst error probability of the LDC codes.
متن کامل