1,721,085 research outputs found
P. Bartoli, D. Boulet, Ph. Lacombe, J.P. Laporte, R. Lifran, F. Montaigne. - L'économie viticole française.
No full textP. Bartoli, D. Boulet, Ph. Lacombe, J.P. Laporte, R. Lifran, F. Montaigne. - L'économie viticole française.. In: Économie rurale. N°187, 1988. pp. 75-77
P. Bartoli, D. Boulet, Ph. Lacombe, J.P. Laporte, R. Lifran, F. Montaigne. - L'économie viticole française.
No full textP. Bartoli, D. Boulet, Ph. Lacombe, J.P. Laporte, R. Lifran, F. Montaigne. - L'économie viticole française.. In: Économie rurale. N°187, 1988. pp. 75-77
Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve
No full textAsymptotics of Moore exponent sets
No full textLet n be a positive integer and I a k-subset of integers in [0,n−1]. Given a k-tuple A=(α0,⋯,αk−1)∈Fqjavax.xml.bind.JAXBElement@58b36835k, let MA,I denote the matrix (αiqjavax.xml.bind.JAXBElement@58d19926) with 0≤i≤k−1 and j∈I. When I={0,1,⋯,k−1}, MA,I is called a Moore matrix which was introduced by E. H. Moore in 1896. It is well known that the determinant of a Moore matrix equals 0 if and only if α0,⋯,αk−1 are Fq-linearly dependent. We call I that satisfies this property a Moore exponent set. In fact, Moore exponent sets are equivalent to maximum rank-distance (MRD) code with maximum left and right idealizers over finite fields. It is already known that I={0,⋯,k−1} is not the unique Moore exponent set, for instance, (generalized) Delsarte-Gabidulin codes and the MRD codes recently discovered in [5] both give rise to new Moore exponent sets. By using algebraic geometry approach, we obtain an asymptotic classification result: for q>5, if I is not an arithmetic progression, then there exists an integer N depending on I such that I is not a Moore exponent set provided that n>N
A family of planar binomials in characteristic 2
No full textPlanar polynomials of type fa,b(x)=ax2javax.xml.bind.JAXBElement@364ca89b+1+bx2javax.xml.bind.JAXBElement@31a47e70+1, a,b∈F2javax.xml.bind.JAXBElement@6b5a89d2⁎ are investigated. In particular, all the possible pairs (a,b)∈(F2javax.xml.bind.JAXBElement@3476b478⁎)2 for which fa,b(x) is planar are determined
A family of permutation trinomials over Fq2
No full textLet p>3 and consider a prime power q=ph. We completely characterize permutation polynomials of Fqjavax.xml.bind.JAXBElement@26b5e0b6 of the type fa,b(X)=X(1+aXq(q−1)+bX2(q−1))∈Fqjavax.xml.bind.JAXBElement@1bc6c375[X]. In particular, using connections with algebraic curves over finite fields, we show that the already known sufficient conditions are also necessary
Planar polynomials arising from linearized polynomials
No full textIn this paper, we construct planar polynomials of the type fA,B(x) = x(xq2 + Axq + Bx) ∈ Fq3 [x], with A, B ∈ Fq. In particular, we completely classify the pairs (A, B) ∈ F2q such that fA,B(x) is planar using connections with algebraic curves over finite fields
On the Classification of Low-Degree Ovoids of Q(4,q)
No full textOvoids of the non-degenerate quadric Q(4,q) of PG(4,q) have been studied since the end of the ’80s. They are rare objects and, beside the classical example given by an elliptic
quadric, only three classes are known for q odd, one class for q even, and a sporadic example for q = 3^5
. It is well known that to any ovoid of Q(4,q) a bivariate polynomial
f(x, y) can be associated. In this paper we classify ovoids of Q(4,q) whose correspondingpolynomial f(x, y) has “low degree” compared with q, in particular, deg(f)<(1/6.3q)^(3/13)-1.
Finally, as an application, two classes of permutation polynomials in characteristic 3 are obtained
- …
