Construction of LPA codes correcting simultaneously random and P-burst block errors

Abstract EN

Linear partition Arihant (LPA) codes [2] have been introduced by the author in [2] and a study of error correcting/detecting capabilities of these code was made with respect to the random block errors.

Also, the concept of P-burst errors has been formulated by the author in [4] to study clustered block errors that occur during the process of communication.

In this paper, we take up the problem of simultaneous correction of random block errors and P-burst errors in LPA spaces and obtain a construction upper bound on the number of parity check digits required for the same