Stanley-Reisner resolution of constant weight linear codes
From MaRDI portal
Publication:2248656
Abstract: Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude that the code is of constant weight
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- A Unified Interpretation of the Binomial Coefficients, the Stirling Numbers, and the Gaussian Coefficients
- Combinatorial Commutative Algebra
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
- Notes on the value function
- Resolutions of Stanley-Reisner rings and Alexander duality
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
Cited in
(7)- Greedy weights for matroids
- Möbius and coboundary polynomials for matroids
- Pure resolutions, linear codes, and Betti numbers
- A generalization of weight polynomials to matroids
- Minimum distance of linear codes and the -invariant
- On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
This page was built for publication: Stanley-Reisner resolution of constant weight linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248656)