Generator matrix for two-dimensional cyclic codes of arbitrary length

有限域及其循环子群的标准生成元

Standard Generators of Finite Fields and their Cyclic Subgroups

本文给出有限域及其乘法循环子群的标准化构造与生成元，旨在为各类软件和数学数据集提供 Conway 多项式的可替代方案。

Resolutions of 2 and 3 dimensional rings of invariants for cyclic groups

Let $G$ be the cyclic group of order $n$ and suppose ${\bf F}$ is a field containing a primitive $n^\text{th}$ root of unity. We consider the ring of invariants ${\bf F}[W]^G$ of a three dimensional representation $W$ of $G$ where $G \subset \text{SL}(W)$. We describe minimal generators and relations for this ring and prove that the lead terms of the relations are quadratic. These minimal generators for the relations form a Gröbner basis with a surprisingly simple combinatorial structure. We describe the graded Betti numbers for a minimal free resolution of $F[W]^G$. The case where $W$ is any …

Polynomial representation of additive cyclic codes and new quantum codes

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator polynomials of all different additive cyclic codes. A minimum distance lower bound for additive cyclic codes will also be provided using linear cyclic codes over $\mathbb{F}_p$. We classify all the symplectic self-dual, self-orthogonal, and nearly self-orthogonal additive cyclic codes over $\mathbb{F}_{p^2}$. Finally, we present ten record-breaking binary quantum …

About the number of generators of a musical scale

Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic group will give the same support set. We prove that this number is always a totient number and characterize the different possible cases. In particular, there exists scales with an arbitrarily large number of different generators, but none with 14 generators. Some connex results and extensions are also given, for instance on characterization via a Discrete F…

The Noether number for the groups with a cyclic subgroup of index two

The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the order of the group plus 1 or 2.

One-Sided Repeated-Root Two-Dimensional Cyclic and Constacyclic Codes

In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field $F=\mathbb{F}_q$. We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate when such codes are self-dual. Moreover, we prove that if there exists an asymptotically good family of one-sided repeated-root two-dimensional cyclic or constacyclic codes, then there exists an asymptotically good family of simple root two-dimensional cyclic or constacyclic codes with parameters at least as good as the first family. Furthermore, we show that …