Title : 
Constacyclic codes, cocycles and a u+v|u-v construction
         
        
        
            Author_Institution : 
Dept. of Math., R. Melbourne Inst. of Technol., Vic., Australia
         
        
        
        
        
            fDate : 
3/1/2000 12:00:00 AM
         
        
        
        
            Abstract : 
A connection between cohomology, cocycles and constacyclic codes is explored. It suggests an isomorphism between cyclic codes of length mn and a direct sum of m constacyclic codes of length n. The isomorphism is used (i) to study the discrete Fourier transforms and the decomposition of group ring codes; (ii) to give a u+v|u-v construction over GF(q) when q is odd. The u+v|u-v construction gives some of the best ternary cyclic codes and classes of “nearly MDS” cyclic codes of length 2q+2. The symmetry of the construction is used to give a new proof that there are no cyclic self-dual codes over GF(q), when q is odd
         
        
            Keywords : 
Galois fields; cyclic codes; discrete Fourier transforms; dual codes; group codes; DFT; Galois field; MDS cyclic codes; cocycles; code length; cohomology; constacyclic codes; cyclic self-dual codes; discrete Fourier transforms; group ring codes decomposition; isomorphism; ternary cyclic codes; Cryptography; Error correction codes; Information rates; Software;
         
        
        
            Journal_Title : 
Information Theory, IEEE Transactions on