By Topic

Convolutional Codes Using Nonlinear Generators for Rate One-third and Memory Order Four

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)
Mayhew, G.L. ; Dept. of Electr. & Syst. Eng., Washington Univ. St. Louis, St. Louis, MO

Performance of a convolutional code depends on the decoding algorithm and that code's distance properties. Performance bounds suggest constructing codes with the largest possible free distance. Published tables provide the feed forward encoding equations that are linear generator polynomials over a binary Galois field. This paper presents results for rate one-third, memory order four, convolutional codes with at least one feed forward encoding equation that is nonlinear over a binary Galois field.

Published in:

Aerospace Conference, 2008 IEEE

Date of Conference:

1-8 March 2008