Decomposition of modular codes for computing test sets and Graver basis
type: Item
instance of: scholarly article
title: Decomposition of modular codes for computing test sets and Graver basis
zbMATH Open document ID: 1279.94145
author: Irene Márquez-Corbella
author: E. Martínez-Moro
published in: Mathematics in Computer Science
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05E40
zbMATH DE Number: 6157613
zbMATH Keywords: matroid theory
zbMATH Keywords: code decompositions
zbMATH Keywords: test sets
zbMATH Keywords: universal test sets
zbMATH Keywords: minimal support codewords
zbMATH Keywords: Gröbner basis
describes a project that uses: SageMath
MaRDI profile type: Publication
full work available at URL: s11786-012-0120-y
OpenAlex ID: W2030765188
cites work: Q4242014
cites work: On the inherent intractability of certain coding problems (Corresp.)
cites work: Gröbner bases and combinatorics for binary codes
cites work: On a Gröbner bases structure associated to linear codes
cites work: The hardness of decoding linear codes with preprocessing
cites work: Q4038746
cites work: On the foundations of linear and integer linear programming I
cites work: Decoding linear block codes for minimizing word error rate (Corresp.)
cites work: A Decomposition Theory for Binary Linear Codes
cites work: On Minimal Tree Realizations of Linear Codes
cites work: Implementing gradient descent decoding
cites work: Algebraic structure of the minimal support codewords set of some linear codes
cites work: On presentations of subsemigroups of \(\mathbb{N}^n\)
cites work: Q4861423
cites work: Construction of set theoretic complete intersections via semigroup gluing
DOI: 10.1007/S11786-012-0120-Y
description: scientific article; zbMATH DE number 6157613