By Topic

A link between quasi-cyclic codes and convolutional codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. Esmaeili ; Dept. of Math. & Stat., Carleton Univ., Ottawa, Ont., Canada ; T. A. Gulliver ; N. P. Secord ; S. A. Mahmoud

Given a quasi-cyclic code with minimum Hamming distance d, a set of convolutional codes is derived with free distance equal to d. It is shown that an increase in the rate of these codes results in a decrease in the memory length. The connection between these codes is illustrated with several well-known quasi-cyclic codes. The free distance of some partial unit memory convolutional codes can be determined using the results in this correspondence

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 1 )