English
Related papers

Related papers: Generalized Reed-Muller codes over Galois rings

200 papers

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…

Information Theory · Computer Science 2017-01-25 Edgar Martínez-Moro , Kamil Otal , Ferruh Özbudak

The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.

Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…

Combinatorics · Mathematics 2019-06-17 José Andrés Armario , Ivan Bailera , Ronan Egan

We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…

Information Theory · Computer Science 2025-09-30 Elena Berardini , Xavier Caruso

We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…

Information Theory · Computer Science 2026-03-26 Jade Nardi , Rodrigo San-José

Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…

Information Theory · Computer Science 2015-11-04 Olav Geil , Stefano Martin

Recently, Dor\"oz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of…

Information Theory · Computer Science 2020-08-28 Karan Khathuria

As we all know, many interesting and important codes are obtained by modifying or combining existing codes. In this paper, we focus on generalized Roth-Lempel (in short, GRL) codes and define a class of extended codes, i.e., the extended…

Information Theory · Computer Science 2025-08-19 Zhonghao Liang , Qunying Liao

We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…

Information Theory · Computer Science 2024-11-12 Rodrigo San-José

Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials being evaluated to yield codewords, are restricted to be homogeneous. The Generalized Hamming Weights (GHW) of a code ${\cal C}$, identify…

Information Theory · Computer Science 2018-06-07 Vinayak Ramkumar , Myna Vajha , P. Vijay Kumar

The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…

Number Theory · Mathematics 2007-09-20 Nan Li , Sheng Chen

In this article, we investigate the decoding of the rank metric Reed--Muller codes introduced by Augot, Couvreur, Lavauzelle and Neri in 2021. These codes are defined from Abelian Galois extensions extending the construction of Gabidulin…

Information Theory · Computer Science 2025-11-26 Alain Couvreur , Rakhi Pratihar

Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are…

Information Theory · Computer Science 2020-06-11 Emmanuel Abbe , Amir Shpilka , Min Ye

In this paper, we give the Jacobi polynomials for first-order generalized Reed--Muller codes. We show as a corollary the nonexistence of combinatorial $3$-designs in these codes.

Combinatorics · Mathematics 2024-02-27 Ryosuke Yamaguchi

Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…

Commutative Algebra · Mathematics 2019-08-20 Jose Martinez-Bernal , Miguel A. Valencia-Bucio , Rafael H. Villarreal

This paper extends the study of rank-metric codes in extension fields $\mathbb{L}$ equipped with an arbitrary Galois group $G = \mathrm{Gal}(\mathbb{L}/\mathbb{K})$. We propose a framework for studying these codes as subspaces of the group…

Information Theory · Computer Science 2020-06-26 Daniel Augot , Alain Couvreur , Julien Lavauzelle , Alessandro Neri

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…

Information Theory · Computer Science 2013-10-22 Muhammad Ilyas , Mieko Yamada

This note presents a descending method that allows us to classify quotients of Reed-Muller codes of lenghth 128 under the action of the affine general linear group.

Discrete Mathematics · Computer Science 2023-05-05 Valérie Gillot , Philippe Langevin

Let $R$ be a commutative unital ring, $a\in R$ and $t$ a positive integer. $a^{t}$-reduced $R$-modules and universally $a^{t}$-reduced $R$-modules are defined and their properties given. Known (resp. new) results about reduced $R$-modules…

Rings and Algebras · Mathematics 2022-05-27 Annet Kyomuhangi , David Ssevviiri

In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…

Number Theory · Mathematics 2014-11-14 F. Patrick Rabarison , Hery Randriamaro