Related papers: A transform approach to polycyclic and serial code…
We study transformations of finite modules over Noetherian local rings that attach to a module $M$ a graded module $H^{0}_{\mathfrak{m}}( \mathrm{gr}_{I}(M))$ defined via partial systems of parameters of $M$. Despite the generality of the…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
In this paper extensions of the classical Fourier, fractional Fourier and Radon transforms to superspace are studied. Previously, a Fourier transform in superspace was already studied, but with a different kernel. In this work, the…
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…
Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…
We introduce an approach to the categorification of rings, via the notion of distributive categories with negative objects, and use it to lay down categorical foundations for the study of super, quantum and non-commutative combinatorics.…
In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
M\"obius transformations have been studied over the field of complex numbers. In this paper, we investigate M\"obius transformations over two rings which are not fields: the ring of double numbers and the ring of dual numbers. We give types…
We study relationships between different formulations of the local principle. Also we establish a connection among the local principle and the non-commutative Fourier transform approach to the investigation of convolution operator algebras.…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…
Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…