Skip navigation
Please use this identifier to cite or link to this item:
Title: On quasi-cyclic codes over ℤq
Authors: Bhaintwal, Maheshanand
Wasan S.K.
Published in: Applicable Algebra in Engineering, Communications and Computing
Abstract: Quasi-cyclic (QC) codes are a remarkable generalization of cyclic codes. Many QC codes have been shown to be best for their parameters. In this paper, some structural properties of QC codes over the prime power integer residue ring ℤq are considered. An l-QC code of length lm over ℤq is viewed both as in the conventional row circulant form and also as a ℤq[x]/〈 xm-1 〉 -submodule of GR(q,l)[x] /〈 xm-1 〉, where GR(q, l) is the Galois extension ring of degree l over ℤq . A necessary and sufficient condition for cyclic codes over Galois rings to be free is obtained and a BCH type bound for them is also given. A sufficient condition for 1-generator QC codes to be ℤq-free is given and a formula to evaluate their ranks is derived. Some distance bounds for 1-generator QC codes are also discussed. The duals of QC codes over ℤqare also briefly discussed. © 2009 Springer-Verlag.
Citation: Applicable Algebra in Engineering, Communications and Computing (2009), 20(43957): 459-480
Issue Date: 2009
Keywords: Codes over rings
Galois rings
Hensel lift
Quasi-cyclic codes
Regular polynomials
ISSN: 9381279
Author Scopus IDs: 32867546000
Author Affiliations: Bhaintwal, M., Centre for Development of Advanced Computing, B-30, Sector-62, Noida 201307, India
Wasan, S.K., Department of Mathematics, Jamia Millia Islamia, New Delhi 110025, India
Corresponding Author: Bhaintwal, M.; Centre for Development of Advanced Computing, B-30, Sector-62, Noida 201307, India; email:
Appears in Collections:Journal Publications [MA]

Files in This Item:
There are no files associated with this item.
Show full item record

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.