By Topic

Punctured uniform 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
$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)

The structure of a uniform convolutional code, i.e., a code whose average distance is equal to its minimum distance, is examined, and results in a parity equation lattice. From this lattice, punctured uniform codes, i.e., uniform codes with parity bits deleted, are constructed, which can be threshold decoded and have limited error propagation. An "optimum" deletion sequence is provided. Some of the punctured uniform codes are optimal from a minimum-distance view point.

Published in:

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