Related papers: Monomial codes under linear algebra point of view
A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…
Modular categories are important algebraic structures in a variety of subjects in mathematics and physics. We provide an explicit, motivated and elementary definition of a modular category over a field of characteristic 0 as an equivalence…
In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $\mathbb{F}_q$ and $\mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of…
Galois images of polycyclic codes over a finite chain ring $S$ and their annihilator dual are investigated. The case when a polycyclic codes is Galois-disjoint over the ring $S,$ is characterized and, the trace codes and restrictions of…
This text answers a question raised by Joux and the second author about the computation of discrete logarithms in the multiplicative group of finite fields. Given a finite residue field $\bK$, one looks for a smoothness basis for $\bK^*$…
The internal bialgebroid -- in a symmetric monoidal category with coequalizers -- is defined. The axioms are formulated in terms of internal entwining structures and alternatively, in terms of internal corings. The Galois property of the…
In this thesis three topics on the model theory of partial differential fields are considered: the generalized Galois theory for partial differential fields, geometric axioms for the theory of partial differentially closed fields, and the…
We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…
We study subfield-subcodes of Generalized Toric (GT) codes over $\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We identify polynomial…
We use the idea of generic extensions to investigate the correspondence between the isomorphism classes of nilpotent representations of a cyclic quiver and the orbits in the corresponding representation varieties. We endow the set $\cal M$…
In this paper we introduce new affine algebraic varieties whose points correspond to associative algebras. We show that the algebras within a variety share many important homological properties. In particular, any two algebras in the same…
The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research…
In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss their dimension and minimal rank drops over the associated residue fields. To this end, we take first steps into the theory of rank-metric…
If the Continuum Hypothesis is false, it implies the existence of cardinalities between the integers and the real numbers. In studying these "cardinal characteristics of the continuum", it was discovered that many of the associated…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The automorphism groups of various linear codes are extensively studied yielding insights into the respective code structure. This knowledge is used in, e.g., theoretical analysis and in improving decoding performance, motivating the…
The mod-2 arithmetic Milnor invariants, introduced by Morishita, provide a decomposition law for primes in canonical Galois extensions of $\mathbb{Q}$ with unitriangular Galois groups, and contain the Legendre and Redei symbols as special…