A NEW BURST AND RANDOM ERROR CORRECTING CODE: NON-BINARY PROJECTION CODING

THIS PROPOSAL IS TO CONDUCT RESEARCH IN A NEW ERROR CORRECTION CODING TECHNIQUE BASED ON AN EXTENSION OF MAJORITY LOGIC CODING. THE CODE HAS AN ALGEBRAIC STRUCTURE THAT PERMITS A HYBRID CODE DESIGN THAT EMPLOYS CYCLIC CODINGIN A NATURAL FASHION WITHIN THE BASIC CODE. THE RESULTING HYBRID CODE HAS INCREASED RANDOM ERROR CORRECTION CAPABILITYWHILE RETAINING THE BURST ERROR CORRECTION CAPABILITY. DECODING WILL BE ACCOMPLISHED BY A SIMPLE ITERATIVE SCHEME, WHEREIN THE NUMBER OF ERRORS IS REDUCED SIGNIFICANTLY WITH EACH ITERATION. THE PROPOSED DECODING ALGORITHM WILL BE CAPABLE OF CORRECTING MANY ERROR PATTERNS OF WEIGHT IN EXCESS OF THE GUARANTEED MINIMUM CORRECTION CAPABILITY, CONTRIBUTING TO THE CODE'S EXCELLENT PERFORMANCE IN ARQ SYSTEMS. THE RESEARCH PROPOSED WILL EXTEND THE BINARY PROJECTION CODE THEORY PIONEERED BY SCS TELECOM, INC. TO NONBINARY ELEMENTS (SYMBOLS) AND INVESTIGATE THE PERFORMANCE OF THESE NONBINARY PROJECTION CODES. THE RESEARCHERS WILL ALSO INVESTIGATE ERASURE DECODING OF BOTH BINARY AND NONBINARY PROJECTION CODES. THE GOAL IS FOR THE ENCODER AND DECODER TO BE EASILY IMPLEMENTED AND OPERATE WITH BIT RATES IN EXCESS OF 20 MBS.