Related papers: A transform approach to polycyclic and serial code…
In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…
Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…
We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…
Two known computation methods and one new computation method for matrix determinant over an integral domain are discussed. For each of the methods we evaluate the computation times for different rings and show that the new method is the…
In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a…
The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…
Permutation polynomials over a ring of modulo $2^w$ are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general,…
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…
The classical commutative coding theory has been recently extended to noncommutative rings of polynomial type. There are many interesting works in coding theory over single Ore extensions. In this review article we present the most relevant…
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…
We introduce a notion of refinements in the context of patching, in order to obtain new results about local-global principles and field invariants in the context of quadratic forms and central simple algebras. The fields we consider are…
In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast…
In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…
In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
We study local equivalence of bounded complexes over a polynomial ring $R[w]$, where $R$ is a noetherian ring. We provide a homological algebra approach to the results, the variants of which have been proved in many places in the…
We propose a new polymerization scheme for scalar fields coupled to gravity. It has the advantage of being a (non-bijective) canonical transformation of the fields and therefore ensures the covariance of the theory. We study it in detail in…
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…