Generalized Hamming weights of projective Reed-Muller-type codes over graphs

DOI10.1016/J.DISC.2019.111639zbMATH Open1434.94109arXiv1812.04106OpenAlexW2970388030MaRDI QIDQ2279286FDOQ2279286

Authors: José Martínez-Bernal, Miguel A. Valencia-Bucio, Rafael H. Villarreal 

Publication date: 12 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $G$ be a connected graph and let $mathbbX$ 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 Reed--Muller-type code over the set $mathbbX$ in terms of graph theoretic invariants. As an application to coding theory we show that if $G$ is non-bipartite and $K$ is a finite field of $mchar(K)eq2$, then the $r$-th generalized Hamming weight of the linear code generated by the rows of the incidence matrix of $G$ is the $r$-th weak edge biparticity of $G$. If $mchar(K)=2$ or $G$ is bipartite, we prove that the $r$-th generalized Hamming weight of that code is the $r$-th edge connectivity of $G$.

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

Recommendations

• Generalized Hamming weights and some parameterized codes
• GHWs of codes arising from Cartesian product of graphs
• Some bounds for the relative generalized Hamming weights of some evaluation codes
• On the generalized Hamming weights of certain Reed-Muller-type codes
• On generalized Hamming weights of some linear codes

zbMATH Keywords

graphsincidence matricesedge connectivitygeneralized Hamming weightsReed-Muller-type codesweak edge biparticity

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Title not available (Why is that?)
• Glossary of signed and gain graphs and allied areas
• Title not available (Why is that?)
• Algebraic geometric codes. Basic notions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the second weight of generalized Reed-Muller codes
• A lower bound on the weight hierarchies of product codes.
• Reed-Muller-type codes over the Segre variety
• On the second Hamming weight of some Reed-Muller type codes
• Generalized Hamming weights for linear codes
• On the generalized Hamming weights of product codes
• Reed-Muller codes on complete intersections.
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
• The second generalized Hamming weight of certain Castle codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Monomial algebras
• Title not available (Why is that?)
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• Codes from incidence matrices of graphs
• Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
• Generalized Hamming Weights for Almost Affine Codes
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Generalized Hamming weights and some parameterized codes
• On the minors of an incidence matrix and Smith normal form
• The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
• Generalized Hamming weights of affine Cartesian codes
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• Generalized Hamming Weights of Irreducible Cyclic Codes
• Generalized minimum distance functions
• Edge Bipartization Faster Than 2^k

Cited In (5)

• Linear codes over signed graphs
• Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers
• GHWs of codes arising from Cartesian product of graphs
• GHWs of codes derived from the incidence matrices of some graphs
• On the generalized Hamming weights of certain Reed-Muller-type codes

Uses Software

• SageMath

This page was built for publication: Generalized Hamming weights of projective Reed-Muller-type codes over graphs

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