We generalize Burton and Weldon\´s result by presenting two cyclic mappings which are one-to-one maps and which, for

and

relatively prime and

and

positive integers, i) maps each of

product codes into the same cyclic code of length

and at the same time orders them to form a cyclic code; and ii) maps each of

product codes into a cyclic code of length

and at the same time orders these

cyclic codes in such a way as to form a cyclic code.