Algebraic structure of the minimal support codewords set of some linear codes
From MaRDI portal
Publication:2275876
DOI10.3934/amc.2011.5.233zbMath1250.94066OpenAlexW2076370378MaRDI QIDQ2275876
Irene Márquez-Corbella, Edgar Martínez-Moro
Publication date: 10 August 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.233
Symbolic computation and algebraic computation (68W30) Integer programming (90C10) Linear codes (general theory) (94B05) Decoding (94B35)
Related Items
On the weak order ideal associated to linear codes ⋮ On the Fan Associated to a Linear Code ⋮ On the ideal associated to a linear code ⋮ Computing Gröbner bases associated with lattices ⋮ Linear label code of a root lattice using Gröbner bases ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ Computing coset leaders and leader codewords of binary codes ⋮ Heuristic decoding of linear codes using commutative algebra
