Document Type

Report

Date

10-1970

Keywords

Codes

Language

English

Disciplines

Computer Sciences

Description/Abstract

Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes ìs derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes Ìs presented. Finally, an improved Gilbert bound for definite decoding is derived.

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.