2000 character limit reached
Stanley-Reisner resolution of constant weight linear codes
Published 12 Apr 2012 in cs.DM and math.CO | (1204.2710v2)
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
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.