By Topic

Cyclic mappings of product codes (Corresp.)

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
$33 $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)

We generalize Burton and Weldon's result by presenting two cyclic mappings which are one-to-one maps and which, for N_1 and N_2 relatively prime and a and b positive integers, i) maps each of ab N_1 \times N_2 product codes into the same cyclic code of length N_1N_2 and at the same time orders them to form a cyclic code; and ii) maps each of ab N_1 \times N_2 product codes into a cyclic code of length N_1N_2 and at the same time orders these ab cyclic codes in such a way as to form a cyclic code.

Published in:

IEEE Transactions on Information Theory  (Volume:21 ,  Issue: 2 )