DocumentCode :
774464
Title :
Abelian codes over Galois rings closed under certain permutations
Author :
T, Kiran ; Rajan, B. Sundar
Author_Institution :
Dept. of Electr. Commun. Eng., Indian Inst. of Sci., India
Volume :
49
Issue :
9
fYear :
2003
Firstpage :
2242
Lastpage :
2253
Abstract :
We study n-length Abelian codes over Galois rings with characteristic pa, where n and p are relatively prime, having the additional structure of being closed under the following two permutations: (i) permutation effected by multiplying the coordinates with a unit in the appropriate mixed-radix representation of the coordinate positions and (ii) shifting the coordinates by t positions. A code is t-quasi-cyclic (t-QC) if t is an integer such that cyclic shift of a codeword by t positions gives another codeword. We call the Abelian codes closed under the first permutation as unit-invariant Abelian codes and those closed under the second as quasi-cyclic Abelian (QCA) codes. Using a generalized discrete Fourier transform (GDFT) defined over an appropriate extension of the Galois ring, we show that unit-invariant Abelian and QCA codes can be easily characterized in the transform domain. For t=1, QCA codes coincide with those that are cyclic as well as Abelian. The number of such codes for a specified size and length is obtained and we also show that the dual of an unit-invariant t-QCA code is also an unit-invariant t-QCA code. Unit-invariant Abelian (hence unit-invariant cyclic) and t-QCA codes over Galois field Fpl and over the integer residue rings are obtainable as special cases.
Keywords :
Galois fields; cyclic codes; discrete Fourier transforms; Abelian codes; Galois rings; code length; code size; codeword; cyclic shift; generalized discrete Fourier transform; integer residue rings; mixed-radix representation; permutations; quasi-cyclic Abelian codes; t-quasi-cyclic code; transform domain; unit-invariant Abelian codes; Binary codes; Cryptography; Decoding; Discrete Fourier transforms; Electronic mail; Fourier transforms; Galois fields; Linear code; Polynomials; Quantum cellular automata;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2003.815816
Filename :
1226611
Link To Document :
بازگشت