By Topic

Further results on product 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)

A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code are L_1 and L_2 -step orthogonalizable, then the product code is ( L_1 + L_2 - 1 )-step orthogonalizable. Further if a \nu th-order product generator code is produced from these original L -step orthogonal izable codes, the new code is at most (\nu +1) step orthogonalizable.

Published in:

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