Cart (Loading....) | Create Account
Close category search window
 

Convolutional codes under a minimal trellis complexity measure

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

4 Author(s)
Uchoa-Filho, B.F. ; GPqCom/EEL/CTC/UFSC, Florianopolis ; Demo Souza, R. ; Pimentel, C. ; Jar, M.

We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.

Published in:

Communications, IEEE Transactions on  (Volume:57 ,  Issue: 1 )

Date of Publication:

January 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.