By Topic

Some optimal partial-unit-memory codes (Corresp.)

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
$31 $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)

A new class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes. These codes are optimal in the sense of having maximum free distance for given values of R, k (the number of encoder inputs), and \mu (the number of encoder memory cells). New optimal codes are given for rates R=l/4, 1/3, 1/2, and 2/3 with \mu \leq 4 and k \leq \mu + 3 , whenever such a code is better than previously known An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes.

Published in:

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