Integer Codes Correcting Burst Asymmetric Errors Within a Byte

This paper presents two types of integer codes capable of correcting burst asymmetric errors within a byte. The presented codes are constructed with the help of a computer and are very efficient in terms of redundancy. The results of a computer search have shown that, for practical data lengths up to 4096 bits, the presented codes use up to two check-bits less than the best burst asymmetric error correcting codes. Besides this, it is shown that the presented codes are suitable for implementation on modern processors