Generalized Hamming weights of affine Cartesian codes

DOI10.1016/J.FFA.2018.01.006MaRDI QIDQ1747914zbMATH OpenOpenAlexFDO

Authors Mrinmoy Datta, Peter Beelen

Publication date 27 April 2018

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.02114

zbMATH Keywords

affine Cartesian codesaffine Hilbert functionsgeneralized Hamming weightszero dimensional varieties

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this article, we give the answer to the following question: Given a field $mathbbF$, finite subsets $A_1,dots,A_m$ of $mathbbF$, and $r$ linearly independent polynomials $f_1,dots,f_{r}inmathbbF[x_1,dots,x_m]$ of total degree at most $d$. What is the maximal number of common zeros $f_1,dots,f_r$ can have in $A_{1}imescdotsimes{A}_m$? For $mathbbF=mathbb{F}_q$, the finite field with $q$ elements, answering this question is equivalent to determining the generalized Hamming weights of the so-called affine Cartesian codes. Seen in this light, our work is a generalization of the work of Heijnen--Pellikaan for Reed--Muller codes to the significantly larger class of affine Cartesian codes.

Recommendations

• Relative generalized Hamming weights of affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• On the generalized Hamming weights of certain Reed-Muller-type codes
• Completing the determination of the next-to-minimal weights of affine cartesian codes
• On the next-to-minimal weight of affine Cartesian codes

Cites work

• A generalization of a combinatorial theorem of macaulay
• Affine Cartesian codes
• Decoding Reed-Muller codes over product sets
• Evaluation codes from an affine variety code perspective
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
• scientific article; zbMATH DE number 1324022 (Why is no real title available?)
• scientific article; zbMATH DE number 1461537 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• More results on the number of zeros of multiplicity at least \(r\)
• On the next-to-minimal weight of affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
• Using Algebraic Geometry
• Weighted Reed-Muller codes revisited

Cited in

(38)

• Relative generalized Hamming weights and extended weight polynomials of almost affine codes
• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• Generalized Hamming weights of codes on multi-dimensional quadrics
• Completing the determination of the next-to-minimal weights of affine cartesian codes
• A note on the generalized Hamming weights of Reed-Muller codes
• Generalized minimum distance functions
• The dual of an evaluation code
• On hitting-set generators for polynomials that vanish rarely
• From primary to dual affine variety codes over the Klein quartic
• GHWs of codes arising from Cartesian product of graphs
• Batch codes from affine Cartesian codes and quotient spaces
• GHWs of codes derived from the incidence matrices of some graphs
• Relative generalized Hamming weights of affine Cartesian codes
• Evaluation codes and their basic parameters
• Generalized Hamming weights of projective Reed-Muller-type codes over graphs
• On the third greedy weight of 4-dimensional codes
• Projective nested Cartesian codes
• Affine Cartesian codes with complementary duals
• On the second Hamming weight of some Reed-Muller type codes
• Codes from symmetric polynomials
• On the generalized Hamming weights of certain Reed-Muller-type codes
• A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
• On the bias of Reed-Muller codes over odd prime fields
• Generalized Hamming Weights for Almost Affine Codes
• Generalized Anticodes in Hamming Spaces
• On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• A robust version of Hegedűs's lemma, with applications
• On the generalized Hamming weights of hyperbolic codes
• Considerate ramp secret sharing
• An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
• Hilbert functions and low-degree randomness extractors
• The weight hierarchy of decreasing norm-trace codes
• Codes parameterized by the edges of a bipartite graph with a perfect matching
• About the generalized Hamming weights of matrix-product codes
• On the next-to-minimal weight of affine Cartesian codes
• Generalized Hamming weights of almost-MDS codes with respect to twisted Reed-Solomon codes
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

This page was built for publication: Generalized Hamming weights of affine Cartesian codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747914)