Accession Number : AD0683497

Title :   ON ITERATIVE DECODING OF BCH CODES AND DECODING BEYOND THE BCH BOUND,

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Tzeng,Kenneth Kai Ming

Report Date : JAN 1969

Pagination or Media Count : 71

Abstract : The work is largely concerned with the decoding problems of error-correcting codes. A direct approach to the solution of Berlekamp's key equation for decoding Bose-Chaudhuri-Hocquenghem codes with the consequent derivation of a modified Berlekamp Iterative Algorithm is presented. Iterative decoding of a syndrome sequence in reverse has been meaningful. A class of reversible cyclic codes is proved to have minimum distance greater than the BCH bound and it has been shown that reverse-sequence iterative decoding is the most natural technique to be coupled with the forward-sequence iterative decoding to decode this class of reversible codes beyond the BCH bound. For cyclic codes with minimum distance greater than their BCH bound, a scheme called syndrome transformation decoding is proposed for decoding the codes beyond their BCH bound. With this scheme, the possible adaption of these codes to be used in compound channels to correct random errors as well as burst errors is shown in an example. Based on the concept of syndrome transformation decoding, cyclic codes for single and multiple solid-burst error correction have been constructed including a simple decoding procedure. (Author)

Descriptors :   (*DECODING, ITERATIONS), ERRORS, CORRECTIONS, TRANSFORMATIONS(MATHEMATICS), ALGORITHMS, CODING, THESES

Subject Categories : Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE