A DIFFERENCE-SET CYCLIC-CODE-(1057,813,34)

This paper presents an overview of the implementation of a difference- set cyclic code (1057,813,34). It is easy to achieve coding and decodi ng circuits. The decoding lays on the analysis of the composite remain der R(c)(x) and the use of a decoding matrix of 33 Boolean equations. The error-correcting algorithm has been improved, so the difference-se t cyclic code (1057,813,34) can collect up to 26 random errors instead of the 16 previous random errors found by the theory. Moreover, 3 dec oding algorithms have been simulated and allow the comparison of their respective efficiency. The hardware achievement is quite easy because the necessary logical elements such as shift delay registers, positiv e-and gates, positive-or gates, positive-exclusive-or gates exist as a set of libraries.