An application of Möller's algorithm to coding theory

DOI10.1007/978-3-540-93806-4_24MaRDI QIDQ3652832zbMATH OpenOpenAlexFDO

Authors Mijail Borges-Quintana, Miguel Angel Borges-Trenard, E. Martínez-Moro

Publication date 16 December 2009

Published in Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-93806-4_24

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Decoding (94B35)

Recommendations

• Computing Gröbner bases associated with lattices
• scientific article; zbMATH DE number 2222667
• A decoding algorithm for binary linear codes using Groebner bases
• Gröbner bases and combinatorics for binary codes
• A Gröbner representation for linear codes

Cited in

(4)

• Computing border bases using mutant strategies
• A coding scheme for m-out-of-n codes
• scientific article; zbMATH DE number 1751828 (Why is no real title available?)
• A Polyhedral Characterization of Border Bases

Describes a project that uses

Uses Software

• GAP
• GBLA_LC

This page was built for publication: An application of Möller's algorithm to coding theory

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