DocumentCode
1543260
Title
A Vandermonde code construction
Author
Hughes, Garry
Author_Institution
Dept. of Defens, CMR-DSTO, Kingston, ACT, Australia
Volume
47
Issue
7
fYear
2001
fDate
11/1/2001 12:00:00 AM
Firstpage
2995
Lastpage
2998
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);
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.959277
Filename
959277
Link To Document