ON DECODING PROJECTIVE GEOMETRY CODES,

Abstract

The report shows that Projective Geometry codes are orthogonalizable in less than or equal to 3 steps. Thus, this class of codes is majority-logic decodable in no more than 3 steps. The improved decoding algorithm reduces the decoding complexity of Projective Geometry codes enormously in most cases. This should make Projective Geometry codes very attractive for practical use on error-control systems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1970
Accession Number
AD0712682

Entities

People

  • C. L. Chen

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coding
  • Control Systems
  • Decoding
  • Geometry
  • Mathematics
  • Projective Geometry

Fields of Study

  • Engineering

Readers

  • Computer Programming and Software Development.