Title :
A Vandermonde code construction
Author_Institution :
Dept. of Defens, CMR-DSTO, Kingston, ACT, Australia
fDate :
11/1/2001 12:00:00 AM
Abstract :
We use a Vandermonde matrix to construct a code of length mn from m codes of length n. A distance estimate for the construction is given. When the starting codes are suitable constacyclic codes, the constructed code is cyclic and from this we obtain new cyclic codes. The results generalize those of Hughes (see ibid., vol.46, p.674-80, 2000) on the u+υ|u-υ construction
Keywords :
cyclic codes; Vandermonde code construction; Vandermonde matrix; code length; constacyclic codes; cyclic codes; distance estimate; maximum-distance separable code; Associate members; Galois fields; Linear code; Modular construction; Modules (abstract algebra);
Journal_Title :
Information Theory, IEEE Transactions on
