Relative Generalized Minimum Distance Functions

2019/07/25 by Sarabia, Manuel Gonzalez, Uribe-paczka, Miguel E., Sarmiento, Eliseo +1
#Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1907.11324

Abstract

In this paper we introduce the relative generalized minimum distance function (RGMDF for short) and it allows us to give an algebraic approach to the relative generalized Hamming weights of the projective Reed--Muller--type codes. Also we introduce the relative generalized footprint function and it gives a tight lower bound for the RGMDF which is much easier to compute.

Related

• Relative Generalized Hamming weights of affine Cartesian codes
• An algorithm for computing generalized Hamming weights and the Sage package GHWs
• A note on a gap in the proof of the minimum distance for Projective Reed-Muller Codes
• A distance-free approach to generalized weights
• Evaluation codes and their basic parameters