Apparatus for correcting error-bursts in binary code

Claim 1

APPARATUS FOR CORRECTING ERRORS IN BINARY CODE COMPRISING, IN COMBINATION: MEANS TO ESTABLISH SAID CODE FROM AN INFORMATION STREAM OF BINARY BITS BY MULTIPLYING SELECTED INFORMATION SEQUENCES THEREFROM, RESPECTIVELY, BY THE REPRESENTATIVE BINARY BIT SEQUENCE OF A GENERATOR POLYNOMIAL, MEANS TO ESTABLISH A SELECTED ORDER OF TRANSMISSION ON A CHANNEL OF THE BINARY BITS OF SAID CODE, AND MEANS TO CORRECT SAID ERRORS SUSTAINED BY SAID CODE DURING SAID TRANSMISSION INCLUDING MEANS FOR EFFECTING A MULTIPLICATIVE POLYNOMIAL COMBINATION OF FIRST, SECOND AND THIRD POLYNOMIALS IN MODULO 2 ALGEBRA OVER A FINITE FIELD HAVING FIRST AND SECOND SHIFT REGISTERS IN WHICH SAID FIRST AND SECOND POLYNOMIALS ARE INITIALLY ESTABLISHED, RESPECTIVELY, AND MEANS FOR SHIFTING SAID SHIFT REGISTERS SYNCHRONOUSLY UNTIL SAID THIRD POLYNOMIAL APPEARS IN SAID SECOND SHIFT REGISTER TO OBTAIN SIMULTANEOUSLY THEREWITH SAID MULTIPLICATIVE POLYNOMIAL COMBINATION IN SAID FIRST SHIFT REGISTER.