Document Type

Report

Date

3-1974

Keywords

Codes

Language

English

Disciplines

Computer Sciences

Description/Abstract

Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are h1(x) and h2(x). This decomposition provides information about the weight distribution of the code.

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.