Stanley-Reisner resolution of constant weight linear codes
DOI10.1007/S10623-012-9767-2zbMATH Open1333.94060arXiv1204.2710OpenAlexW3105429518MaRDI QIDQ2248656FDOQ2248656
Hugues Verdure, Trygve Johnsen
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.2710
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Linear codes (general theory) (94B05)
Cites Work
- Resolutions of Stanley-Reisner rings and Alexander duality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Commutative Algebra
- Notes on the value function
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- A Unified Interpretation of the Binomial Coefficients, the Stirling Numbers, and the Gaussian Coefficients
- Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
Cited In (6)
- 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 \(\alpha\)-invariant
- On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes
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)