By Topic

Minimality and canonicity tests for rational generator matrices for 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

2 Author(s)
C. O'Donoghue ; Dept. of Electron. Eng., Limerick Univ., Ireland ; C. J. Burkley

We derive computationally efficient minimality and canonicity tests for rational generator matrices for convolutional codes. The first set of tests are given in terms of easily obtained equivalent polynomial generator matrices and are suitable for small k and n. New tests are derived based on the scalar generator matrix G which are computationally more efficient for large k and n and small v. The application of these tests to generator matrices for (P)UM codes is studied. Finally, the results of O'Donoghue and Burkley (see Lecture Notes in Computer Science, vol.1365, p.258-65, 1997) are extended to the enumeration of minimal and canonical rational generator matrices

Published in:

Information Theory Workshop, 1998

Date of Conference:

22-26 Jun 1998