Integer codes capable of correcting burst asymmetric errors

In this paper, we present a class of integer codes capable of correcting burst asymmetric errors. The presented codes are constructed with the help of a computer and have the potential to be used in various practical systems, such as optical networks and VLSI memories. In order to evaluate the performance of the proposed codes, the paper analyzes the probability of erroneous decoding for different bit error rates. The presented codes are also analyzed from a rate-efficiency point of view. The obtained results show that for many data lengths they require less check-bits than optimal burst error correcting codes.