Improvements on binary coding using parallel computing

Abstract

The error-correcting codes have many applications in fields related to communications. This paper tackles some partition algorithms to optimize the data encoding. These algorithms are based on sliding windows and allow for a parallel implementation. We analyse them and then expound a comparative study between the different partition methods that we propose.

Keywords:

• code theory
• parallel computation

2000 AMS Subject Classifications :

• 94B05
• 65Y05

Acknowledgements

The research reported in this paper has been partially supported by Project FEDER-MEC-MTM2007-61193.

Notes

Maybe the reader was expecting 16,384 instead of 13,000. This is not the case, given the excessive memory requirements of the former. Nevertheless, this has no effect whatsoever on the results, merely breaks the powers-of-two sequence