Linear codes over signed graphs

DOI10.1007/s10623-019-00683-0zbMath1452.94117arXiv1904.09487OpenAlexW2979328112WikidataQ127119645 ScholiaQ127119645MaRDI QIDQ2291662

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

Publication date: 31 January 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

regularitymultiplicitycycleincidence matrixlinear codecircuitsigned graphedge connectivitygeneralized Hamming weightfrustration indexvector matroid

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40) Signed and weighted graphs (05C22) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items

GHWs of codes arising from Cartesian product of graphs ⋮ GHWs of codes derived from the incidence matrices of some graphs ⋮ On the structure of matroids arising from the gain graphs ⋮ Linear ternary codes of strongly regular signed graphs ⋮ Evaluation codes and their basic parameters ⋮ Greedy weights for matroids ⋮ The \(v\)-number of edge ideals

Uses Software

• Macaulay2
• SageMath
• Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Wei-type duality theorems for matroids
• Biased graphs. I: Bias, balance, and gains
• A generalization of weight polynomials to matroids
• Polar syzygies in characteristic zero: The monomial case
• Signed graphs
• Biased graphs. II: The three matroids
• Support weight distribution of linear codes
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• Hilbert functions of graded algebras
• MacWilliams identities and matroid polynomials
• The integral closure of subrings associated to graphs
• Glossary of signed and gain graphs and allied areas
• A lower bound on the weight hierarchies of product codes.
• Reed-Muller-type codes over the Segre variety
• Combinatorics and commutative algebra.
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Codes from incidence matrices of graphs
• Generalized minimum distance functions
• Generalized star configurations and the Tutte polynomial
• Generalized Hamming weights of projective Reed-Muller-type codes over graphs
• The second generalized Hamming weight of certain Castle codes
• Higher support matroids
• On the notion of balance of a signed graph
• Toric Ideals Generated by Circuits
• Generalized Hamming Weights of Irreducible Cyclic Codes
• The Higher Weight Enumerators of the Doubly-Even, Self-Dual $[48, 24, 12$ Code]
• Generalized Hamming weights for linear codes
• On the generalized Hamming weights of product codes
• A Coding Approach to Signed Graphs
• Generalized Hamming weights of q-ary Reed-Muller codes
• The Geometry of Syzygies
• Rees algebras of edge ideals
• Monomial Algebras
• Generalized Hamming Weights for Almost Affine Codes
• On the Complexity of Some Enumeration Problems for Matroids