2000 character limit reached
Generalized Quasi-Cyclic Codes Over $\mathbb{F}_q+u\mathbb{F}_q$ (1307.1746v1)
Published 6 Jul 2013 in cs.IT and math.IT
Abstract: Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}{q}+u\mathbb{F}{q}$, where $u2=0$, $q=pn$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC codes, quasi-cyclic (QC) codes over $\mathbb{F}_q+u\mathbb{F}_q$ are also discussed briefly in this paper.