Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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:

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