Generalized Quasi-Cyclic Codes Over Fq+uFq\mathbb{F}_q+u\mathbb{F}_q

preprint2013arXivOpen access

Abstract

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring Fq+uFq\mathbb{F}_{q}+u\mathbb{F}_{q}, where u2=0u^2=0, q=pnq=p^n, nn a positive integer and pp 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 Fq+uFq\mathbb{F}_q+u\mathbb{F}_q are also discussed briefly in this paper.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.