By Topic

The free distance of fixed convolutional rate 2/4 codes meets the Costello bound

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

3 Author(s)
Chepyzhov, V.V. ; Inst. for Problems of Inf. Transmission, USSR Acad. of Sci., Moscow, Russia ; Smeets, B.J.M. ; Zigangirov, K.S.

The long standing question whether the free distance of fixed rate convolutional codes is as good as the Costello bound was almost solved by K.S. Zigangirov and J.L. Massey (1987). They proved that this is indeed the case for codes with long branch length and rates 2/c, c⩾5. It is shown that there exist fixed convolutional codes of rate 2/4 whose free distance dfree meets the Costello bound originally derived for time varying convolutional codes

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 4 )