Phased burst error-correcting array codes

Phased burst error-correcting array codes

= p2 < h, by the assumption j 2 (3 / 2) m-(3 / 2). If t > t o we simply add points with errorvalue zero to the previously stated construction. This concludes 0 We have used the Hermitian curve because the rational points on this are so easy to handle, but this is probably also the case for many other curves. For a code C * (j) from a Hermitian curve, we have however more information in the deco...

Codes Correcting Phased Burst Erasures

We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...

Burst Error Correcting Codes and Lattice Paths

Moderate-density Burst Error Correcting Linear Codes

It is well known that during the process of transmission errors occur predominantly in the form of a burst. However, it does not generally happen that all the digits inside any burst length get corrupted. Also when burst length is large then the actual number of errors inside the burst length is also not very less. Keeping this in view, we study codes which detect/correct moderate-density burst...

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.