By Topic

Bounded distance decoding of unit memory 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)
Justesen, J. ; Inst. of Circuit Theor. & Telecommun., Tech. Univ. Denmark, Lyngby, Denmark

We discuss minimum distance decoding of convolutional codes. The relevant distance functions are defined, and the set of correctable error patterns is described by a sequence of weight constraints. Decoding methods for error patterns of bounded weight are described, and it is demonstrated that these methods offer a favorable combination of performance and complexity. Exact values and upper bounds on the error probability are calculated from finite state models of the decoding process

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 5 )