Related papers: On Galois self-orthogonal algebraic geometry codes
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a…
In this paper, we study cyclic codes over the Galois ring ${\rm GR}({p^2},s)$. The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length $p^a$ over ${\rm GR}({p^2},s)$. Combining with some known…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
In a quantum mechanical treatment of gauge theories (including general relativity), one is led to consider a certain completion, $\agb$, of the space $\ag$ of gauge equivalent connections. This space serves as the quantum configuration…
This paper is concerned with difference equations on elliptic curves. We establish some general properties of the difference Galois groups of equations of order two, and give applications to the calculation of some difference Galois groups.…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…
A point $P$ in projective space is said to be Galois with respect to a hypersurface if the function field extension induced by the projection from $P$ is Galois. We present a hyperplane section theorem for Galois points. Precisely, if $P$…
Let $A$ be a unital associative algebra over a field $k$. All unital associative algebras containing $A$ as a subalgebra of a given codimension $\mathfrak{c}$ are described and classified. For a fixed vector space $V$ of dimension…
The paper deals with a particular type of a projective ring plane defined over the ring of double numbers over Galois fields, R\_{\otimes}(q) \equiv GF(q) \otimes GF(q) \cong GF(q)[x]/(x(x-1)). The plane is endowed with (q^2 + q + 1)^2…
A criterion for the existence of a birational embedding into a projective plane with three collinear Galois points for algebraic curves is presented. The extendability of an automorphism induced by a Galois point to a linear transformation…
The recently introduced Galois symmetries of RCFT are generalized, for the WZW case, to `quasi-Galois symmetries'. These symmetries can be used to derive a large number of equalities and sum rules for entries of the modular matrix S,…
The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
In the context of error control in random linear network coding, it is useful to construct codes that comprise well-separated collections of subspaces of a vector space over a finite field. In this paper, the metric used is the so-called…
We show all the possible structures of finite subgroups of the automorphism groups of elliptic curves. Here the automorphism means the biholomorphic transformation. Using the result, we determine every Galois group G at outer Galois point…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois…
This paper constitutes our initial effort in developing sparse grid discontinuous Galerkin (DG) methods for high-dimensional partial differential equations (PDEs). Over the past few decades, DG methods have gained popularity in many…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…