Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/10617
Title: Skew quasi-cyclic codes over Galois rings
Authors: Bhaintwal, Maheshanand
Published in: Designs, Codes, and Cryptography
Abstract: Recently there has been a lot of interest on algebraic codes in the setting of skew polynomial rings. In this paper we have studied skew quasi-cyclic (QC) codes over Galois rings. We have given a necessary and sufficient condition for skew cyclic codes over Galois rings to be free, and determined a distance bound for free skew cyclic codes. A sufficient condition for 1-generator skew QC codes to be free is determined. Some distance bounds for free 1-generator skew QC codes are discussed. A canonical decomposition of skew QC codes is presented. © 2011 Springer Science+Business Media, LLC.
Citation: Designs, Codes, and Cryptography (2012), 62(1): 85-101
URI: https://doi.org/10.1007/s10623-011-9494-0
http://repository.iitr.ac.in/handle/123456789/10617
Issue Date: 2012
Keywords: Galois rings
Quasi-cyclic codes
Skew polynomial rings
ISSN: 9251022
Author Scopus IDs: 32867546000
Author Affiliations: Bhaintwal, M., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India
Corresponding Author: Bhaintwal, M.; Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India; email: mahesfma@iitr.ernet.in
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.