Are $2$ -Weight Projective Cyclic Codes Irreducible?
J. Wolfmann · IEEE Transactions on Information Theory · 2005
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