ON DECODING EUCLIDEAN GEOMETRY CODES,

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)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1970
Accession Number
AD0709342

Entities

People

  • C. L. Chen

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coding
  • Decoding
  • Geometry
  • Mathematics
  • Notation
  • Projective Geometry

Fields of Study

  • Engineering

Readers

  • Computer Programming and Software Development.