What is it about?
This paper presents a class of integer codes that can correct any burst of length 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 tablebased error control procedure requires relatively small memory resources
Featured Image
Read the Original
This page is a summary of: Integer Codes Correcting Burst Errors within a Byte, IEEE Transactions on Computers, February 2013, Institute of Electrical & Electronics Engineers (IEEE),
DOI: 10.1109/tc.2011.243.
You can read the full text:
Contributors
The following have contributed to this page