Stanley-Reisner resolution of constant weight linear codes

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

Cited by in corpus (2)

• A generalization of weight polynomials to matroids
• Pure Resolutions, Linear Codes, and Betti Numbers