#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Carlos Munuera
- Signal Processing
- 2007

We show some relations between steganographic algorithms and error-correcting codes. By using these relations we give a method to construct good steganographic protocols and deduce their properties… (More)

- Carlos Munuera
- IEEE Trans. Information Theory
- 1992

For a linear [n, k, d] code, it is well known that d ≤ n−k+1 (see [12]), and when d = n−k+1, it is called the MDS code (maximum distance separable). For every n ≤ q + 1 there is an MDS [n, k, d] code… (More)

We determine the Weierstrass semigroup of a pair of rational points on Norm-Trace curves. We use this semigroup to improve the lower bound on the minimum distance of two-point algebraic geometry… (More)

- Antonio Campillo, José Ignacio Farrán, Carlos Munuera
- IEEE Trans. Information Theory
- 2000

In this paper we compute the order (or Feng-Rao) bound on the minimum distance of one-point algebraic geometry codes CΩ(P, ρlQ), when the Weierstrass semigroup at the point Q is an Arf semigroup. The… (More)

The quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from Castle curves, namely those whose number of rational… (More)

- Olav Geil, Carlos Munuera, Diego Ruano, Fernando Araripe Gonçalves Torres
- Adv. in Math. of Comm.
- 2011

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another… (More)

- Carlos Munuera, Morgan Barbier
- Adv. in Math. of Comm.
- 2012

In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion… (More)

- Cícero Carvalho, Carlos Munuera, Ercilio da Silva, Fernando Araripe Gonçalves Torres
- IEEE Transactions on Information Theory
- 2007

Hoslashholdt, van Lint, and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa codes that can be represented by this… (More)

- Carlos Munuera
- IEEE Trans. Information Theory
- 1994

- Angela I. Barbero, Carlos Munuera
- SIAM J. Discrete Math.
- 2000

We compute the complete weight hierarchies of all Hermitian codes. The tools used are the arithmetic of Hermitian curves and the order bound on the generalized Hamming weights.