Minimum distance of linear codes and the -invariant

DOI10.1016/J.AAM.2015.09.007zbMATH Open1381.94116OpenAlexW2964183421MaRDI QIDQ745079FDOQ745079

Authors Mehdi Garrousian, Stefan O. Tohǎneanu

Publication date 13 October 2015

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.03286

zbMATH Keywords

minimum distancefiltrationFitting idealinverse systemsOrlik-Terao algebra

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Homological methods in commutative ring theory (13D99)

Abstract: The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the methods of commutative/homological algebra to find connections between the minimum distance and the $alpha$-invariant of such modules.

Recommendations

• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• On the De Boer-Pellikaan method for computing minimum distance
• scientific article; zbMATH DE number 1441986
• Minimum distance functions of complete intersections
• Bounding invariants of fat points using a coding theory construction

Cites work

• scientific article; zbMATH DE number 1276821 (Why is no real title available?)
• scientific article; zbMATH DE number 671739 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 889125 (Why is no real title available?)
• Bounding invariants of fat points using a coding theory construction
• Cayley-Bacharach and evaluation codes on complete intersections
• Codes, arrangements and matroids
• Commutative algebras for arrangements
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Lower bounds on minimal distance of evaluation codes
• Modular decomposition of the Orlik-Terao algebra
• On the De Boer-Pellikaan method for computing minimum distance
• Products of linear forms and Tutte polynomials
• Stanley-Reisner resolution of constant weight linear codes
• Star configurations in \(\mathbb{P}^n\)
• The Geometry of Syzygies
• The Orlik-Terao algebra and 2-formality
• The minimum distance of sets of points and the minimum socle degree

Cited in

(15)

• The minimum distance of codes in an array coming from telescopic semigroups
• Addition-deletion results for the minimal degree of logarithmic derivations of hyperplane arrangements and maximal Tjurina line arrangements
• Steiner systems and configurations of points
• Homological properties of ideals generated by fold products of linear forms
• Footprint and minimum distance functions
• Generalized star configurations and the Tutte polynomial
• Bounding invariants of fat points using a coding theory construction
• Minimum block length of a linear q-ary code with specified dimension and code distance
• On ideals generated by \(a\)-fold products of linear forms
• The minimum locality of linear codes
• On the Jacobian ideal of an almost generic hyperplane arrangement
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Generalized minimum distance functions
• On the Geramita-Harbourne-Migliore conjecture
• Fat points, partial intersections and Hamming distance

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Minimum distance of linear codes and the \(\alpha\)-invariant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745079)