[PDF][PDF] Algebraic structure of the minimal support codewords set of some linear codes
I Márquez-Corbella, E Martínez-Moro - Adv. Math. Commun, 2011 - academia.edu
It has been widely known that complete decoding for binary linear codes can be regarded as
an linear integer programming problem with binary arithmetic conditions. Conti and Traverso …
an linear integer programming problem with binary arithmetic conditions. Conti and Traverso …
Computing coset leaders and leader codewords of binary codes
M Borges-Quintana, MA Borges-Trenard… - Journal of Algebra …, 2015 - World Scientific
In this paper we use the Gröbner representation of a binary linear code to give efficient
algorithms for computing the whole set of coset leaders, denoted by and the set of leader …
algorithms for computing the whole set of coset leaders, denoted by and the set of leader …
[PDF][PDF] CONSTRUCCIONES MINIMALES ASOCIADAS A CÓDIGOS CONCATENADOS GENERALIZADOS
I MÁRQUEZ-CORBELLA, E MARTÍNEZ-MORO… - singacom.uva.es
In order to obtain the set of codewords of minimal support of codes defined over Fq we must
compute a Graver basis of the ideal associated to such codes, see [8]. The main aim of this …
compute a Graver basis of the ideal associated to such codes, see [8]. The main aim of this …
[引用][C] Programación lineal modular y bases de Graver: cálculo de soportes minimales de códigos lineales
I Márquez-Corbella, E Martınez-Moro - VII Jornadas de Matemática Discreta y …, 2010