By Topic

On the structure of convolutional and cyclic 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

1 Author(s)

Algebraic convolutional coding theory is considered. It is shown that any convolutional code has a canonical direct decomposition into subcodes and that this decomposition leads in a natural way to a minimal encoder. Considering cyclic convolutional codes, as defined by Piret, an easy application of the general theory yields a canonical direct decomposition into cyclic subcodes, and at the same time a canonical minimal encoder for such codes. A list of pairs (n,k) admitting completely proper cyclic (n, k) -convolutional codes is included.

Published in:

IEEE Transactions on Information Theory  (Volume:25 ,  Issue: 6 )