Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.