On the weak order ideal associated to linear codes

DOI10.1007/s11786-018-0349-1zbMath1432.94163arXiv1705.06609OpenAlexW2964345304WikidataQ129650277 ScholiaQ129650277MaRDI QIDQ1616169

Edgar Martínez-Moro, Miguel Angel Borges-Trenard, Mijail Borges-Quintana

Publication date: 1 November 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

linear codesorder idealstest setcorrectable errorstrial setzero neighbours

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Computing an Invariant of a Linear Code

Cites Work

• Unnamed Item
• Algebraic structure of the minimal support codewords set of some linear codes
• Error-Correction Capability of Binary Linear Codes
• On a Gröbner bases structure associated to linear codes
• Fundamentals of Error-Correcting Codes
• The threshold probability of a code
• Computing coset leaders and leader codewords of binary codes
• Coset analysis of reed muller codes via translates of finite vector spaces
• A Polyhedral Characterization of Border Bases

This page was built for publication: On the weak order ideal associated to linear codes