A note on the generalized Hamming weights of Reed-Muller codes

07/03/2018
by   Peter Beelen, et al.
0

In this note, we give a very simple description of the generalized Hamming weights of Reed--Muller codes. For this purpose, we generalize the well-known Macaulay representation of a nonnegative integer and state some of its basic properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

Two classes of linear codes and their generalized Hamming weights

The generalized Hamming weights (GHWs) are fundamental parameters of lin...
research
09/13/2019

Relative Generalized Hamming weights of affine Cartesian codes

We explicitly determine all the relative generalized Hamming weights of ...
research
04/28/2019

A short note on Goppa codes over Elementary Abelian p-Extensions of F_p^s(x)

In this note, we investigate Goppa codes which are constructed by means ...
research
12/14/2021

Relative generalized Hamming weights of evaluation codes

The aim of this work is to algebraically describe the relative generaliz...
research
11/15/2017

Deep Epitome for Unravelling Generalized Hamming Network: A Fuzzy Logic Interpretation of Deep Learning

This paper gives a rigorous analysis of trained Generalized Hamming Netw...
research
07/25/2022

Generalized weights of convolutional codes

In 1997 Rosenthal and York defined generalized Hamming weights for convo...
research
03/08/2021

Geometrical Representation for Number-theoretic Transforms

This short note introduces a geometric representation for binary (or ter...

Please sign up or login with your details

Forgot password? Click here to reset