Related papers: Generalized Reed-Muller codes over Galois rings
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
Following Johnsen and Verdure (2013), we can associate to any linear code $C$ an abstract simplicial complex and in turn, a Stanley-Reisner ring $R_C$. The ring $R_C$ is a standard graded algebra over a field and its projective dimension is…
In 1970 Delsarte, Goethals and Mac Williams published a seminal paper on generalized Reed-Muller codes where, among many important results, they proved that the minimal weight codewords of these codes are obtained through the evaluation of…
Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let $\mathbb{F}_q$ be the $q$ elements…
Frieze patterns have attracted significant attention recently, motivated by their relationship with cluster algebras. A longstanding open problem has been to provide a combinatorial model for frieze patterns over the ring of integers modulo…
We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…
In this article we generalize a classical result by Passman on primeness of unital strongly group graded rings to the class of nearly epsilon-strongly group graded rings which are not necessarily unital. Using this result, we obtain (i) a…
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are…
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…
This paper studies the parameters for which Reed-Muller (RM) codes over $GF(2)$ can correct random erasures and random errors with high probability, and in particular when can they achieve capacity for these two classical channels.…
Let $G$ be a cyclic $p$-group for some prime number $p>0$ and let $R$ be a complete discrete valuation ring in mixed characteristic. In this paper, we present a generalization of two results that characterize $RG$-permutation modules,…
The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…
We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…
In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…
We construct, for any finite commutative ring $R$, a family of representations of the general linear group $\mathrm{GL}_n(R)$ whose intertwining properties mirror those of the principal series for $\mathrm{GL}_n$ over a finite field.
We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…
This paper presents an extension of the concept of NR-clean introduced in [12] to graded ring theory. We define and explore graded NR-clean rings, which generalize the class of graded U-nil clean previously studied in [15]. We provide…
Motivated by the computations done in \cite{C1}, where I introduced and discussed what I called the groupoid of generalized gauge transformations, viewed as a groupoid over the objects of the category $\mathsf{Bun}_{G,M}$ of principal…
We introduce the notion of sum-matroids and show its association with sum-rank metric codes. As a consequence, some results for sum-rank metric codes by Mart\'inez-Pe\~nas are generalized for sum-matroids. The sum-matroids generalize the…
We develop a theory of reduction for generalized Kahler and hyper-Kahler structures which uses the generalized Riemannian metric in an essential way, and which is not described with reference solely to a single generalized complex…