DocumentCode :
773093
Title :
Shadow codes and weight enumerators
Author :
Dougherty, Steven T.
Author_Institution :
Dept. of Math., Scranton Univ., PA, USA
Volume :
41
Issue :
3
fYear :
1995
fDate :
5/1/1995 12:00:00 AM
Firstpage :
762
Lastpage :
768
Abstract :
The technique of using shadow codes to build larger self-dual codes is extended to codes over arbitrary fields. It is shown how to build the codes and how to determine the new weight enumerator as well. For codes over fields equipped with a square root of -1 and not of characteristic 2, a self-dual code of length n+2 can be built from a self-dual code of length n; for codes over a field without a square root of -1 and not of characteristic 2 a self-dual code of length n+4 is built from a self-dual code of length n; and for codes over fields of characteristic 2 the length of the new self-dual code depends on the presence of the all-one vector in the subcode chosen. In certain cases using the subcode of vectors orthogonal to the all-one vector, the new weight enumerator can be calculated directly from the original weight enumerator. Specific examples of the technique are illustrated for codes over F3, F4, and F5
Keywords :
dual codes; all-one vector; code length; self-dual codes; shadow codes; square root; subcode; weight enumerators; Galois fields; Hamming weight; Linear code; Mathematics; Vectors;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.382022
Filename :
382022
Link To Document :
بازگشت