J. W. P. Hirschfeld

Bio: J. W. P. Hirschfeld is an academic researcher from University of Sussex. The author has contributed to research in topics: Finite geometry & Projective space. The author has an hindex of 23, co-authored 56 publications receiving 4582 citations. Previous affiliations of J. W. P. Hirschfeld include University of Brighton.

On the size of arcs in projective spaces

Abstract: The known results on the maximum size of an arc in a projective space or equivalently the maximum length of a maximum distance separable linear code are surveyed. It is then shown that this maximum is q+1 for all dimensions up to q in the cases that q=11 and q=13; the result for q=11 was previously known. The strategy is to first show that a 11-arc in PG (3,11) and a 12-arc in PG (3,13) are subsets of a twisted cubic, that is, a normal rational curve.

On the classification of geometric codes by polynomial functions

Abstract: It is shown how to represent algebraically all functions that have a zero sum on all μ-dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.

Analytic Number Theory

Abstract: Introduction Arithmetic functions Elementary theory of prime numbers Characters Summation formulas Classical analytic theory of $L$-functions Elementary sieve methods Bilinear forms and the large sieve Exponential sums The Dirichlet polynomials Zero-density estimates Sums over finite fields Character sums Sums over primes Holomorphic modular forms Spectral theory of automorphic forms Sums of Kloosterman sums Primes in arithmetic progressions The least prime in an arithmetic progression The Goldbach problem The circle method Equidistribution Imaginary quadratic fields Effective bounds for the class number The critical zeros of the Riemann zeta function The spacing of zeros of the Riemann zeta-function Central values of $L$-functions Bibliography Index.

Introduction to finite fields and their applications

Abstract: The first part of this book presents an introduction to the theory of finite fields, with emphasis on those aspects that are relevant for applications. The second part is devoted to a discussion of the most important applications of finite fields especially information theory, algebraic coding theory and cryptology (including some very recent material that has never before appeared in book form). There is also a chapter on applications within mathematics, such as finite geometries. combinatorics. and pseudorandom sequences. Worked-out examples and list of exercises found throughout the book make it useful as a textbook.

A course in combinatorics

Abstract: This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject. The book is ideal for courses on combinatorical mathematics at the advanced undergraduate or beginning graduate level. Working mathematicians and scientists will also find it a valuable introduction and reference.

The Geometry of Two-Weight Codes

Abstract: On etudie les relations entre les codes [n,k] lineaires a deux poids, les ensembles (n,k,h 1 h 2 ) projectifs et certains graphes fortement reguliers