Generalized weights of codes over rings and invariants of monomial ideals
From MaRDI portal
Publication:6138907
DOI10.5070/c63261989arXiv2201.05813OpenAlexW4386744954MaRDI QIDQ6138907
Elisa Gorla, Alberto Ravagnani
Publication date: 16 December 2023
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.05813
linear codesmatroidcodes over ringsgraded Betti numberssupportsgeneralized weightsmonomial ideal of a code
Linear codes (general theory) (94B05) Principal ideal rings (13F10) Syzygies, resolutions, complexes and commutative rings (13D02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The matroid of supports of a linear code
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- Pure resolutions, linear codes, and Betti numbers
- Higher support matroids
- Codes, Arrangements and Matroids
- Generalized Hamming weights for linear codes
- Weight Enumeration and the Geometry of Linear Codes
- The intractability of computing the minimum distance of a code
- Minimal vectors in linear codes
- Monomial Ideals
- Code Enumerators and Tutte Polynomials
- On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
This page was built for publication: Generalized weights of codes over rings and invariants of monomial ideals