Result: ON DECODING EUCLIDEAN GEOMETRY CODES
Title:
ON DECODING EUCLIDEAN GEOMETRY CODES
Authors:
Contributors:
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Source:
DTIC AND NTIS
Publication Year:
1970
Collection:
Defense Technical Information Center: DTIC Technical Reports database
Subject Terms:
Document Type:
Academic journal
text
File Description:
text/html
Language:
English
Availability:
Rights:
APPROVED FOR PUBLIC RELEASE
Accession Number:
edsbas.4A9B0D8F
Database:
BASE
Further Information
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)