Referenced Items are not available for this document.
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
Published in:
Information Theory, IEEE Transactions on
(Volume:46
,
Issue:
2
)
Date of Publication: Mar 2000
- Page(s):
- 674 - 680
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 6548337
- Digital Object Identifier :
- 10.1109/18.825841
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 2000
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
