Document Type

Report

Date

10-1969

Keywords

Codes

Language

English

Disciplines

Computer Sciences

Description/Abstract

A counterexample to a conjecture on the number of constraint lengths required to achieve the free distance of a rate l/n systematic convolutional code is presented.

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.