Accession Number : AD0709342

Title :   ON DECODING EUCLIDEAN GEOMETRY CODES,

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Chen,C. L.

Report Date : JUL 1970

Pagination or Media Count : 19

Abstract : An improved decoding algorithm for Euclidean Geometry codes is presented. It is shown that this class of codes can be orthogonalized in less than or equal to 3 steps. That is, it requires no more than 3 steps of majority logic in decoding these codes. This results greatly reduces the decoding complexity without reducing the error-correcting capabilities of the codes. The proposed decoding algorithm is a general one. In fact, it is applicable for all codes that are constructed from finite geometries. The application to Projective Geometry codes will be presented in a separate report. (Author)

Descriptors :   (*DECODING, ALGORITHMS), CODING, ERRORS, GEOMETRY, THEOREMS

Subject Categories : Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE