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...

Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi} be a hidden Markov process, i.e., a functional of a Markov chain with a finite state space, and Wb(Z1Z2 . . . Zn) denote the number of burst errors that appear in Z1Z2 . . . Zn, where the number of burst errors is counted using Gabidulin’s ...

In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single ...

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.

Abshacf-The lack of representativeness in the existing analysis concerning the problem of estimation of bit error rates for narrowband digital communications in the presence of atmospheric burst noise, arising due to the omission of consideration of the structure and time parameters of the noise bursts, is emphasized. A method of analysis in which these parameters can suitably be introduced is ...

Errors encountered in digital wireless channels are not independent but rather form bursts or clusters. Error models aim to investigate the statistical properties of bursty error sequences at either packet level or bit level. Packet-level error models are crucial to the design and performance evaluation of high-layer wireless communication protocols. This paper proposes a general design procedu...

Reed Solomon (RS) codes are widely used to detect and correct data errors in transmission and storage systems. Hence it is used in many digital communication and storage devices. In existing system Reformulated inversion less Burst error correcting (RiBC) algorithm is used. But it lacks in speed, throughput & area. To overcome this Algebraic Soft Decision (ASD) algorithm is proposed. This Propo...

Abstract Certain classical codes can be viewed isomorphically as ideals of group algebras, while studying their algebraic structures help extracting the code properties. Research has shown that this was remarkably efficient in case when generators are idempotents. In quantum error correction, theory stabilizer formalism requires self-orthogonal additive over finite field GF (4), which, via lens...

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 ...