DocumentCode :
805271
Title :
Z(pk+1)-linear codes
Author :
Ling, San ; Blackford, Jason Thomas
Author_Institution :
Dept. of Math. Sci., Nat. Univ. of Singapore, Singapore
Volume :
48
Issue :
9
fYear :
2002
fDate :
9/1/2002 12:00:00 AM
Firstpage :
2592
Lastpage :
2605
Abstract :
We characterize codes over Zp which are the Gray images of (1-pk)-cyclic codes or cyclic codes over Z(pk+l) (k≥1). A necessary and sufficient condition for the Gray image of a Z(p2)-linear (1-p)-cyclic code to be linear is given. In many cases, this yields an explicit description of the Gray image of a linear (1-p)-cyclic code over Z(p2), of length relatively prime to p. Linear cyclic codes over Z(p2) whose Gray images are linear cyclic codes over Zp have been characterized. Some generalizations of these results to the case of Z(pk+1), where k≥2, are also obtained.
Keywords :
cyclic codes; linear codes; (1-pk) -cyclic codes; Gray images; Z(pk+1)-linear codes; constacyclic code; generalizations; linear code; linear cyclic codes; necessary and sufficient condition; Binary codes; Computer science; Cryptography; Geometry; Kernel; Linear code; Propulsion; Sociotechnical systems; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2002.801473
Filename :
1027789
Link To Document :
بازگشت