Integer Codes Correcting Burst Asymmetric Errors Within a Byte

Abstract

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.

KEYWORDS:

• Integer codes
• Error correction
• Burst asymmetric errors
• Multicore processors

Additional information

Notes on contributors

Aleksandar Radonjic

Aleksandar Radonjic received the Dipl Ing degree in telecommunications, the Dipl Ing degree in instrumentation and PhD degree in electrical and computer engineering, all from the University of Novi Sad, Serbia. Currently, he is a research associate with the Institute of Technical Sciences of the Serbian Academy of Sciences and Arts. His research interests include error control codes, fault-tolerant computing, VLSI design and computer networking. Corresponding author. Email: [email protected]

Vladimir Vujicic

Vladimir Vujicic received the BSc degree in electrical engineering from University of Belgrade, Serbia, and the MSc and PhD degrees in electrical engineering from the University of Novi Sad, Serbia. From 1975 to 2013 he has been with the Faculty of Technical Sciences, University of Novi Sad, Serbia. Currently, he is a full professor at the Institute of Technical Sciences of the Serbian Academy of Sciences and Arts. His research interests are fields of electrical measurements and fault-tolerant computing. Email: [email protected]