ML p(r)ior | The Generalized Reed-Muller codes and the radical powers of a modular algebra

The Generalized Reed-Muller codes and the radical powers of a modular algebra

2016-01-28
1601.07633 | cs.IT
First, a new proof of Berman and Charpin's characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra. Secondly, the same method is used for the study of the Generalized Reed-Muller codes over a non prime field.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2019-03-08

It is well known that for any finite Galois extension field $K/F$, with Galois group $G = \mathrm{Ga… show more
PDF

Highlights - Most important sentences from the article

2019-03-20

With a small suitable modification, dropping the projectivity condition, we extend the notion of a F… show more
PDF

Highlights - Most important sentences from the article

2019-04-24
1904.10885 | cs.IT

Group codes are right or left ideals in a group algebra of a finite group over a finite field. Follo… show more
PDF

Highlights - Most important sentences from the article

2019-04-18
1904.08696 | cs.IT

Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications … show more
PDF

Highlights - Most important sentences from the article

2018-01-25
1801.08407 | cs.IT

We define a linear code $C_\eta(\delta_T,\delta_X)$ by evaluating polynomials of bidegree $(\delta_T… show more
PDF

Highlights - Most important sentences from the article

2017-07-09

Using commutative algebra methods we study the generalized minimum distance function (gmd function) … show more
PDF

Highlights - Most important sentences from the article

2017-12-03
1712.00747 | math.AG

Let $X$ be a complete simplicial toric variety over a finite field $\mathbb{F}_q$ with homogeneous c… show more
PDF

Highlights - Most important sentences from the article

2018-12-16

Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\… show more
PDF

Highlights - Most important sentences from the article

2018-07-13
1807.05294 | cs.IT

This is a survey on weight enumerators, zeta functions and Riemann hypothesis for linear and algebra… show more
PDF

Highlights - Most important sentences from the article

2018-12-21

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalize… show more
PDF

Highlights - Most important sentences from the article

2018-08-29

The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use… show more
PDF

Highlights - Most important sentences from the article

2017-11-29

If $\mathbb{F}_{q}$ is a finite field, $C$ is a vector subspace of $\mathbb{F}_{q}^{n}$ (linear code… show more
PDF

Highlights - Most important sentences from the article

2018-10-11

In this paper, a linear $\ell$-intersection pair of codes is introduced as a generalization of linea… show more
PDF

Highlights - Most important sentences from the article

2018-07-23

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension … show more
PDF

Highlights - Most important sentences from the article

2017-09-22
1709.07546 | cs.IT

In this paper, we study a special kind of factorization of $x^n+1$ over $\mathbb{F}_q, $ with $q$ a … show more
PDF

Highlights - Most important sentences from the article

2017-03-03
1703.01267 | cs.IT

The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the componen… show more
PDF

Highlights - Most important sentences from the article