Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pure Resolutions, Linear Codes, and Betti Numbers

Published 5 Feb 2020 in cs.IT, math.AC, and math.IT | (2002.01799v2)

Abstract: We consider the minimal free resolutions of Stanley-Reisner rings associated to linear codes and give an intrinsic characterization of linear codes having a pure resolution. We use this characterization to quickly deduce the minimal free resolutions of Stanley-Reisner rings associated to MDS codes as well as constant weight codes. We also deduce that the minimal free resolutions of Stanley-Reisner rings of first order Reed-Muller codes are pure, and explicitly describe the Betti numbers. Further, we show that in the case of higher order Reed-Muller codes, the minimal free resolutions are almost always not pure. The nature of the minimal free resolution of Stanley-Reisner rings corresponding to several classes of two-weight codes, besides the first order Reed-Muller codes, is also determined.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.