Related papers: Generalized Reed-Muller codes over Galois rings

The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…

We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS…

Motivated by the very recent work of Gao, Y., Chen, J., Wang, J., Zou, H. [Comm. Algebra, 49(8) (2021) 3241-3254; MR4283143], we introduce two new generalized inverses named weak Drazin (WD) and weak Drazin Moore-Penrose (WDMP) inverses for…

Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

For odd length $n$, the cyclic codes construction over $\Re= \Z_4[v]/ \langle v^2-v \rangle$ is provided. The hulls of cyclic codes over $\Re$ are studied. The average $2$-dimension $E(n)$ of the hulls of cyclic codes over $\Re$ is also…

The aim of this paper is to investigate the algebraicity behavior of reductions of $D$-finite power series modulo prime numbers. For many classes of D-finite functions, such as diagonals of multivariate algebraic series or hypergeometric…

Many variants of RSA cryptosystem exist in the literature. One of them is RSA over polynomials based on Galois approach. In standard RSA modulus is product of two large primes whereas in the Galois approach author considered the modulus as…

For projective Reed--Muller-type codes we give a global duality criterion in terms of the v-number and the Hilbert function of a vanishing ideal. As an application, we provide a global duality theorem for projective Reed--Muller-type codes…

In this paper, we show that if the product $(D_1D_2, d_1d_2)$ of generalized derivations $(D_1, d_1)$ and $(D_2, d_2)$ on an algebra $A$ is a generalized derivation, then $d_1D_2$ and $d_2D_1$ map $A$ into $\hbox{rad}(A)$. Also, for…

In this paper, we investigate hypersurfaces defined over a ring of algebraic integers, and show that if the projection from a point induces a Galois extension over either a number field or the residue field associated with a prime ideal…

In this paper, we investigate the generalized Pell sequence, the generalized complex Pell sequence and the generalized dual Pell sequence using the Pell numbers. We obtain special cases of these sequences. Furthermore, we give recurrence…

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

We study the number of ramified prime numbers in finite Galois extensions of $\mathbb{Q}$ obtained by specializing a finite Galois extension of $\mathbb{Q}(T)$. Our main result is a central limit theorem for this number. We also give some…

We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…

In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed-Muller codes. Given a finite Galois extension $\mathbb{L} / \mathbb{K}$, these codes are…

We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…

List decoding of codes can be seen as the generalization of unique decoding of codes While list decoding over finite fields has been extensively studied, extending these results to more general algebraic structures such as Galois rings…

This paper provides the Generalized Mattson Solomon polynomial for repeated-root polycyclic codes over local rings that gives an explicit decomposition of them in terms of idempotents that completes the single root study. It also states…

We introduce and develop a structure theory of a new class of noncommutative rings - Galois orders, that generalize classical orders in noncommutative rings. Galois orders realized as certain subrings of invariants in skew semigroup rings.…