相关论文: The Projective General Linear Group $\mathrm{PGL}_…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

We present a uniform framework for constructing $3$-designs from $\mathrm{GL}_2(\mathbb F_q)$-invariant subspaces of $\mathbb F_q[X,Y]_k$, the space of homogeneous polynomials of degree $k$. Given such a subspace $W$, we associate a…

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Surface codes have historically been the dominant choice for quantum error correction due to their superior error threshold performance. However, recently, a new class of Generalized Bicycle (GB) codes, constructed from binary circulant…

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

In this paper, we show that the projective Reed-Muller~(PRM) codes form a family of locally correctable codes~(LCC) in the regime of low query complexities. A PRM code is specified by the alphabet size $q$, the number of variables $m$, and…

In this work we use generalized deformed gauge groups for investigation of symmetry of general relativity (GR). GR is formulated in generalized reference frames, which are represented by (anholonomic in general case) affine frame fields.…

This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

We present a complete algebraic description of the field of first-order joint projective invariants for configurations of \( n \) points in the plane, under the natural diagonal action of the projective group \( PGL(3,\mathbb{R}) \). For \(…

The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…

Let $G$ be a subgroup of the three dimensional projective group $\mathrm{PGL}(3,q)$ defined over a finite field $\mathbb{F}_q$ of order $q$, viewed as a subgroup of $\mathrm{PGL}(3,K)$ where $K$ is an algebraic closure of $\mathbb{F}_q$.…

The prime graph of a finite group $G$ is denoted by $\ga(G)$ whose vertex set is $\pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $\ga(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by…

A novel Hopf algebra $ ( {\tilde G}_{r,s} )$, depending on two deformation parameters and five generators, has been constructed. This $ {\tilde G}_{r,s}$ Hopf algebra might be considered as some quantisation of classical $GL(2) \otimes…

We propose graph theoretic equivalents for existence of a finite projective plane. We then develop a new approach and see that the problem of existence of a finite projective plane of order n is linked up with a subset of sharply 2…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…

The $\Z_{p^s}$-additive codes of length $n$ are subgroups of $\Z_{p^s}^n$, and can be seen as a generalization of linear codes over $\Z_2$, $\Z_4$, or $\Z_{2^s}$ in general. A $\Z_{p^s}$-linear generalized Hadamard (GH) code is a GH code…