dc.contributor.authorLing, San
dc.contributor.authorSole, Patrick
dc.identifier.citationLing, S., & Solé, P. (2005). On the Algebraic Structure of Quasi-Cyclic Codes III: Generator Theory. IEEE Transactions on Information Theory, 51(7), 2692-2700.en_US
dc.description.abstractFollowing Parts I and II, quasi-cyclic codes of given index are studied as codes over a finite polynomial ring. These latter codes are decomposed by the Chinese Remainder Theorem (CRT), or equivalently the Mattson-Solomon transform, into products of shorter codes over larger alphabets. We characterize and enumerate self-dual one-generator quasi-cyclic codes in that context. We give an algorithm to remove some equivalent codes from that enumeration. A generalization to multigenerator codes is sketched.en_US
dc.relation.ispartofseriesIEEE transactions on information theoryen_US
dc.rights© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TIT.2005.850142].en_US
dc.subjectDRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation
dc.titleOn the algebraic structure of quasi-cyclic codes III : generator theoryen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.description.versionAccepted versionen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record