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

DOI10.1016/J.DISC.2019.111639MaRDI QIDQ2279286zbMATH OpenOpenAlexFDO

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)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

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$.

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

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• A lower bound on the weight hierarchies of product codes.
• Algebraic geometric codes. Basic notions
• 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\)
• Edge Bipartization Faster Than 2^k
• Generalized Hamming Weights for Almost Affine Codes
• Generalized Hamming Weights of Irreducible Cyclic Codes
• Generalized Hamming weights and some parameterized codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of affine Cartesian codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Generalized minimum distance functions
• Glossary of signed and gain graphs and allied areas
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Monomial algebras
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• On the generalized Hamming weights of product codes
• On the minors of an incidence matrix and Smith normal form
• On the second Hamming weight of some Reed-Muller type codes
• On the second weight of generalized Reed-Muller codes
• Reed-Muller codes on complete intersections.
• Reed-Muller-type codes over the Segre variety
• The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
• The second generalized Hamming weight of certain Castle codes
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)

Cited in

(5)

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

Describes a project that uses

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)