Generalized weights of codes over rings and invariants of monomial ideals

DOI10.5070/C63261989arXiv2201.05813OpenAlexW4386744954MaRDI QIDQ6138907FDOQ6138907

Elisa Gorla, Alberto Ravagnani

Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Abstract: We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a code. Our main result states that, under suitable assumptions, the generalized weights of a code can be obtained from the graded Betti numbers of its associated monomial ideal. In the case of $mathbb{F}_q$-linear codes endowed with the Hamming metric, the ideal coincides with the Stanley-Reisner ideal of the matroid associated to the code via its parity-check matrix. In this special setting, we recover the known result that the generalized weights of an $mathbb{F}_q$-linear code can be obtained from the graded Betti numbers of the ideal of the matroid associated to the code. We also study subcodes and codewords of minimal support in a code, proving that a large class of $R$-linear codes is generated by its codewords of minimal support.

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

zbMATH Keywords

linear codesmatroidgraded Betti numberscodes over ringssupportsgeneralized weightsmonomial ideal of a code

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Linear codes (general theory) (94B05) Principal ideal rings (13F10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The intractability of computing the minimum distance of a code
• Minimal vectors in linear codes
• Monomial Ideals
• Generalized Hamming weights for linear codes
• Codes, Arrangements and Matroids
• Weight Enumeration and the Geometry of Linear Codes
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Higher support matroids
• The matroid of supports of a linear code
• Code Enumerators and Tutte Polynomials
• Duality of codes supported on regular lattices, with an application to enumerative combinatorics
• Pure resolutions, linear codes, and Betti numbers
• On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes

Cited In (2)

• On weight spaces of polynomial representations of the general linear group as linear codes
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Codes over \(R_k\), Gray maps and their binary images 👍 👎
• Linear codes over \({\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}\) 👍 👎
• Decomposition of modular codes for computing test sets and Graver basis 👍 👎
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids 👍 👎
• Demi-matroids from codes over finite Frobenius rings 👍 👎
• On g-th MDS Codes and Matroids 👍 👎
• Computing generalized hamming weights of binary linear codes via free resolutions 👍 👎

This page was built for publication: Generalized weights of codes over rings and invariants of monomial ideals

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