By Topic

On bit-level trellis complexity of Reed-Muller 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

2 Author(s)
Chung-Chin Lu ; Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Sy-Hann Huang

A formula, which relates the state dimensions of a minimal trellis of a Reed-Muller code to those of another Reed-Muller code with lower order and shorter length, is derived. The state dimension at every position of a minimal trellis of any Reed-Muller code can be obtained by a recursive application of this formula

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 6 )