Image from Syndetics
Applications of finite fields / edited by Dieter Gollmann.
Contributor(s): Gollmann, Dieter
| Institute of Mathematics and Its Applications.
Material type: 
BookSeries: Institute of Mathematics and Its Applications conference series ; New series 59.Publisher: Oxford : New York : Clarendon Press, Oxford University Press, 1996Description: xii,139 p. : ill. ; 24 cm. + hbk.ISBN: 0198511957.Subject(s): Finite fields (Algebra) -- Congresses | Coding theory -- Congresses | Cryptography -- CongressesDDC classification: 512.74
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 512.74 (Browse shelf(Opens below)) | 1 | Available | 00069024 |
Total holds: 0
Enhanced descriptions from Syndetics:
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.
Includes bibliographical references.
Table of contents provided by Syndetics
- 1 Bases and the distribution of irreducible and primitive polynomials over finite fields
- 2 Construction and distribution for irreducible trinomials over finite fields
- 3 Congruences for generalised Dickson polynomials
- 4 Dickson polynomials and completely normal elements over finite fields
- 5 An iterated normal elements over finite fields
- 6 Weakly self-dual normal bases in finite fields
- 7 On the quaternary [11,6,5] and [12,6,6] codes
- 8 On the nonexistence of some Quatenary codes
- 9 A new RSA-type cryptosystem based on singular cubic curves
- 10 A generalisation of the discrete Fourier transform
- 11 On a generalized minimum distance Reed-Solomon decoding algorithm