Error-correction of linear codes via colon ideals

DOI10.1016/J.JALGEBRA.2015.07.035zbMath1359.14024arXiv1409.8387OpenAlexW2962931006MaRDI QIDQ497727

Benjamin E. Anzis, Ştefan O. Tohǎneanu

Publication date: 25 September 2015

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

linear codesfree resolutionssaturationminimum distancecolon ideals

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Syzygies, resolutions, complexes and commutative rings (13D02) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Related Items (3)

Generalized star configurations and the Tutte polynomial ⋮ On the Geramita-Harbourne-Migliore conjecture ⋮ On ideals generated by \(a\)-fold products of linear forms

Uses Software

• Macaulay2
• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Star configurations in \(\mathbb{P}^n\)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases
• Linear free resolutions and minimal multiplicity
• On the De Boer-Pellikaan method for computing minimum distance
• Saturation and Castelnuovo-Mumford regularity
• Attacking and Defending the McEliece Cryptosystem
• A commutative algebraic approach to the fitting problem

This page was built for publication: Error-correction of linear codes via colon ideals