#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1999

2017

- This year (2)
- Last 5 years (21)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mijail Borges-Quintana, Miguel A. Borges-Trenard, Patrick Fitzpatrick, Edgar Martínez-Moro
- Appl. Algebra Eng. Commun. Comput.
- 2008

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gröbner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for the code. By associating the code with the set of cycles in a graph, we can solve the problem of finding all codewords of… (More)

- Irene Marquez Corbella, Edgar Martínez-Moro, Ruud Pellikaan
- Des. Codes Cryptography
- 2013

This paper addresses the question of how often the square code of an arbitrary l-dimensional subcode of the code GRS k (a, b) is exactly the code GRS 2k−1 (a, b * b). To answer this question we first introduce the notion of gaps of a code which allows us to characterize such subcodes easily. This property was first stated and used in [10] where Wieschebrink… (More)

- Edgar Martínez-Moro, Jorge Mozo-Fernández, Carlos Munuera
- IACR Cryptology ePrint Archive
- 2003

In this paper we introduce the class of composite access structures for secret sharing. We also provide secret sharing schemes realizing these structures and study their information rates. As a particular case of this construction, we present the subclass of iterated threshold schemes, a large class of ideal secret sharing schemes.

- Irene Marquez Corbella, Edgar Martínez-Moro
- Adv. in Math. of Comm.
- 2011

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 [8] have proposed an efficient algorithm which uses Gröbner bases to solve integer programming with ordinary integer arithmetic conditions. Ikegami and Kaji [11] extended the… (More)

- Irene Marquez Corbella, Edgar Martínez-Moro, Ruud Pellikaan
- Des. Codes Cryptography
- 2014

This paper addresses the question of retrieving the triple

We show herein that a pattern based on FGLM techniques can be used for computing Gröbner bases, or related structures, associated to linear codes. This Gröbner bases setting turns out to be strongly related to the combinatorics of the codes.

- Irene Marquez Corbella, Edgar Martínez-Moro, Ruud Pellikaan, Diego Ruano
- J. Symb. Comput.
- 2014

Code-based cryptography is an interesting alternative to classic number-theoretic public key cryptosystem since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryptosystems such as algebraic geometry codes. In [62] for so called very strong algebraic geometry codes

- Mijail Borges-Quintana, Miguel A. Borges-Trenard, Irene Marquez Corbella, Edgar Martínez-Moro
- 2010 IEEE Information Theory Workshop
- 2010

There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper [15] mentions that both algorithms have the same philosophy but in fact they are rather different. The purpose of this communication is to show that both algorithms can be seen as two ways of understanding the… (More)

- Edgar Martínez-Moro, Alejandro Piñera-Nicolás, Ignacio F. Rúa
- Finite Fields and Their Applications
- 2013

- Edgar Martínez-Moro
- IEEE Transactions on Information Theory
- 2004

Niederreiter and Xing (2000) recently proposed a propagation rule for linear codes.O/spl uml/zbudak and Stichtenoth showed that the Niederreiter-Xing construction is a particular construction of a matrix-product code. Cheng, Cheng, and Sun analyzed the case when Niederreiter-Xing rule commutes with duality. The aim of this correspondence is to generalize… (More)