Related papers: Monomial codes under linear algebra point of view
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…
We develop a Galois theory for systems of linear difference equations with an action of an endomorphism {\sigma}. This provides a technique to test whether solutions of such systems satisfy {\sigma}-polynomial equations and, if yes, then…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.
Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a semi-linear map…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois…
We first give a characterization for Mathieu subspaces of univariate polynomial algebras over fields in terms of their radicals. We then deduce that for some classes of classical univariate orthogonal polynomials the Image Conjecture is…
Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite…
Algebraic tools in statistics have recently been receiving special attention and a number of interactions between algebraic geometry and computational statistics have been rapidly developing. This paper presents another such connection,…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
We introduce and investigate new invariants on the pair of modules $M$ and $N$ over quantum affine algebras $U_q'(\mathfrak{g})$ by analyzing their associated R-matrices. From new invariants, we provide a criterion for a monoidal category…
For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
We create plots of algebraic integers in the complex plane, exploring the effect of sizing the integers according to various arithmetic invariants. We focus on Galois theoretic invariants, in particular creating plots which emphasize…
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…
Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those…
We explore the enumerative problem of finding lines on cubic surfaces defined by symmetric polynomials. We prove that the moduli space of symmetric cubic surfaces is an arithmetic quotient of the complex hyperbolic line, and determine…
Conjectures are given for Hilbert series related to polynomial invariants of finite general linear groups, one for invariants mod Frobenius powers of the irrelevant ideal, one for cofixed spaces of polynomials.
Feigin-Stoyanovsky's type subspaces for affine Lie algebras of type $C_\ell^{(1)}$ have monomial bases with a nice combinatorial description. We describe bases of whole standard modules in terms of semi-infinite monomials obtained as "a…