A Class of Threshold Decodable Block Codes.

Abstract

A class of binary block codes is defined which is easily decodable. The parity check matrices of these codes are completely orthogonalized, permitting single-step threshold decoding of each received information bit to take place. Several examples with minimum distances equal to or greater than 4 are given and compared to the Gilbert bound. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 23, 1976
Accession Number
ADA029895

Entities

People

  • Barney Reiffen

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Coding
  • Decoding
  • Message Decoding
  • Notation

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.