Applications of finite fields : based on the proceedings of a conference organized by the Institute of Mathematics and Its Applications on the applications of finite fields held at the Royal Holloway, University of London in July 1994

Bibliographic Information

Applications of finite fields : based on the proceedings of a conference organized by the Institute of Mathematics and Its Applications on the applications of finite fields held at the Royal Holloway, University of London in July 1994

edited by Dieter Gollman

(The Institute of Mathematics and its Applications conference series, new ser., 59)

Clarendon Press, 1996

Available at  / 29 libraries

Search this Book/Journal

Description and Table of Contents

Description

This book discusses practical and theoretical work on the applications of finite fields, particularly coding theory and crytography. It addresses issues related to the construction of polynomials and of bases of finite fields with specific properties. It will be of value to graduate and postgraduate pure and applied mathematicians, computer scientists and engineers. This book is intended for graduate and postgraduate pure and applied mathematicians, computer scientists and engineers.

Table of Contents

G.L. Muller: Bases and the distribution of irreducible and primitive polynomials over finite fields. I.F. Blake, S. Gao and R.J. Lambert: Construction and distribution for irreducible trinomials over finite fields. P.T. Young: Congruences for generalised Dickson polynomials. A. Scheerhorn: Dickson polynomials and completely normal elements over finite fields. H. Meyn: An iterated normal elements over finite fields. W. Geiselmann: Weakly self-dual normal bases in finite fields. S. Dodunekov and I. Landgev: On the quaternary [11,6,5] and [12,6,6] codes. R. Hill and I. Landgev: On the nonexistence of some Quatenary codes. H. Kuwakado and K. Koyama: A new RSA-type cryptosystem based on singular cubic curves. S.R. Blackburn: A generalisation of the discrete Fourier transform. R.E. Reile: On a generalized minimum distance Reed-Solomon decoding algorithm

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top