Computing an Invariant of a Linear Code

DOI10.1007/978-3-030-43120-4_17zbMath1497.13050OpenAlexW3011247962MaRDI QIDQ5014679

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

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43120-4_17

zbMATH Keywords

code equivalencecoset leadersleader codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Cites Work

• Unnamed Item
• Unnamed Item
• On the weak order ideal associated to linear codes
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Error-Correction Capability of Binary Linear Codes
• On a Gröbner bases structure associated to linear codes
• Computing automorphism groups of error-correcting codes
• Is code equivalence easy to decide?
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
• Computing coset leaders and leader codewords of binary codes
• A Polyhedral Characterization of Border Bases

This page was built for publication: Computing an Invariant of a Linear Code