#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1950

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jacques Amar, Laurent Vaur, Marc Perret, Christine Bailleau, Sylvie Etienne, Bernard Chamontin
- Journal of hypertension
- 2002

OBJECTIVE
To determine whether blood pressure control in a general practice setting is influenced by the presence of additional risk factors, and to analyse the role of antihypertensive therapy in this relationship.
DESIGN
A cross-sectional study was conducted with a sample of 3153 general practitioners.
SETTING
Primary care.
PARTICIPANTS
The first… (More)

- Marc Perret
- EUROCODE
- 1990

Abstract . Let q he a power of a prime number, Fq the finite field with q elements, n an integer dividing q 1, n > 2, and g a character of order n of the multiplicative group Fq. I f X is an algebraic curve defined over Fq and if G is a divisor on X, we define a non linear code F(q, X, G, n, X) on an alphabet with n + 1 letters.We compute the parameters of… (More)

- Yves Aubry, Marc Perret
- Finite Fields and Their Applications
- 2004

We give a formula for the number of rational points of projective algebraic curves de ned over a nite eld, and a bound \ a la Weil" for connected ones. More precisely, we give the characteristic polynomials of the Frobenius endomorphism on the etale `-adic cohomology groups of the curve. Finally, as an analogue of Artin's holomorphy conjecture, we prove… (More)

- Yves Aubry, Marc Perret
- 2003

We prove, as an analogy of a conjecture of Artin, that if Y −→ X is a finite flat morphism between two singular reduced absolutely irreducible projective algebraic curves defined over a finite field, then the numerator of the zeta function of X divides those of Y in Z[T ]. Then, we give some interpretations of this result in terms of semi-abelian varieties.

- Marc Perret
- Coding Theory and Applications
- 1988

- Majid Farhadi, Marc Perret
- Finite Fields and Their Applications
- 2008

The aim of this paper is to explain how, starting from a Goppa code C(X,G, P1, ..., Pn) and a cyclic covering π : Y → X of degree m, one can twist the initial code to another one C(X,G + Dχ, P1, ..., Pn), where Dχ is a non-principal degree 0 divisor on X associated to a character χ of Gal(Y/X), in the hope that `X(G + Dχ) > `X(G). We give, using a MAGMA… (More)

- Marc Perret
- AAECC
- 1991

Let q be a power of an odd prime number and Fq be the finite field with q elements. We will construct a binary spherical code from an algebraic curve C defined over Fq and a rational divisor G on C, as the twist by the quadratic character 11 of the Goppa code L(G). The computation of the parameters of this code is based on the study of some character sums.… (More)

- Marc Perret, A Derobert
- Annales odonto-stomatologiques
- 1969

- Joseph Dumont, R. A. C. Thomas, Marc Perret
- Annales odonto-stomatologiques
- 1965