Title :
Are 2-weight projective cyclic codes irreducible?
Author :
Wolfmann, Jacques
Author_Institution :
Groupe de Recherche en Math. et Informatique, Univ. du Sud Toulon-Var, La Garde
Abstract :
We prove the following result on a 2-weight projective cyclic code C over Fq. If q=2 then C is irreducible. If qne2 then either C is irreducible or C is the direct sum of two 1-weight irreducible cyclic codes
Keywords :
cyclic codes; 1-weight irreducible cyclic code; 2-weight projective cyclic code; Cryptography; Decoding; Equations; Hamming distance; Information theory; Modules (abstract algebra); Notice of Violation; Poles and towers; Reed-Solomon codes; Cyclic codes; irreducible cyclic codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.840882
