ENCODING AND DECODING CYCLIC CODE GROUPS,

Abstract

It is shown that the product of two cyclic codes with block lengths relatively prime can be described in terms of two interlaced codes. An improved characterization of the generating polynomial of the product code is provided in terms of the generating polynomials of the two original codes. It is shown that the product code and seven other codes related to the product code (called a code group) can all be obtained from four canonical polynomials which may be calculated using the Euclidean Algorithm. These results then lead to simple encoder realizations for cyclic code groups and to a decoding algorithm, called cascade decoding. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1969
Accession Number
AD0701772

Entities

People

  • Norman Abramson

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coders
  • Coding
  • Data Processing Equipment
  • Decoding
  • Message Decoding
  • Message Processing
  • Notation
  • Polynomials

Fields of Study

  • Engineering

Readers

  • Computer Programming and Software Development.