STUDY ON APPLICATION OF CODING THEORY

Abstract

Several new results are obtained by using a code set algebra. The most important is a necessary and sufficient condition for the unique decomposability of a compound code, i.e., a code which cannot be described by a single finite code table. This is a ma rix form for the well known algorithm of Sardinas and Patterson which applie to simple code . (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 31, 1961
Accession Number
AD0266100

Entities

People

  • A.e. Laemmel

Organizations

  • New York University Tandon School of Engineering

Tags

DTIC Thesaurus Topics

  • Algorithms

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Graph Algorithms and Convex Optimization.
  • Snow Cover Descriptors for Reptiles and Their Illustrations.