On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
Designs, Codes and Cryptography
Applicable Algebra in Engineering, Communication and Computing
Skew codes of prescribed distance or rank
Designs, Codes and Cryptography
Coding with skew polynomial rings
Journal of Symbolic Computation
On quasi-cyclic codes over $${\mathbb{Z}_q}$$
Applicable Algebra in Engineering, Communication and Computing
Codes as Modules over Skew Polynomial Rings
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Quasicyclic codes of index l over Fq viewed as Fq[x]-submodules of Fql[x]/ċ xmċ1ċ
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On the construction of skew quasi-cyclic codes
IEEE Transactions on Information Theory
Skew cyclic codes of arbitrary length
International Journal of Information and Coding Theory
On the algebraic structure of quasi-cyclic codes .I. Finite fields
IEEE Transactions on Information Theory
Quasi-cyclic codes over Z4 and some new binary codes
IEEE Transactions on Information Theory
On the algebraic structure of quasi-cyclic codes III: generator theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.