Issue No. 02 - Feb. (2013 vol. 62)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.243
Aleksandar Radonjic , University of Novi Sad, Novi Sad
Vladimir Vujicic , University of Novi Sad, Novi Sad
This paper presents a class of integer codes that can correct any burst of length \le l within a b-bit byte. Their main advantages lie in linear complexity of encoding and decoding procedures, as well as in the fact that a look-up table-based error control procedure requires relatively small memory resources.
Fires, Decoding, Table lookup, Complexity theory, Encoding, Error correction, Hardware, error correction and detection, Integer codes, burst errors, error set
V. Vujicic and A. Radonjic, "Integer Codes Correcting Burst Errors within a Byte," in IEEE Transactions on Computers, vol. 62, no. , pp. 411-415, 2013.