Sav Te Introduction to finite fields and their applications RUDOLF LIDL unig Toma Haart. sa HARALD NIBDERREITER Aaron Acad of Sims, Vom, Ansa CAMBRIDGE UNIVERSITY PRESS Cambridge London New York New Rochelle “Melbourne Sydneyreinsert tay te serene” Eee a 10 omg Dey Pro 6 inl ia i ae Une Pres Cae = Tere ne nf Games Cai Psion ate a att ad oe and pon, ior» {me lt Ne el eta Ss ome Contents Prelace { Algsbeaie Foundations Geoops ings and Fields Polynomials etd Extensions Brerins| { ‘Sacre of Fite Fels ‘Charueciation of Fate Fields Route of Ireducle Polynomials ‘Traces Nor, and ses Roots of Unity apd Clot Plynonia Representation of Elements of Finite Fs ‘Wasderbor’s These Exerenet ‘Chapter Polym ovr Fine Fils 1 Order of Plyuomiss and Primitive Polynomials 2 Trreducible PolynomialsChaper 1 Construction of ineduible Polos st o us m2 Factorization f Potoumia rs Factorization over Small Finite else 10 FFetoriation over Large Fite Fads 19 Caleltion of Roots of Pojaomiais 10. Freres 19, pone Suns ‘Gonmctere (Gawain Sums Frere, ‘near Recrring Seems Feadhack Shit Regine Periodicity Propet Insp Response Sequences, Characteristic Polynomial Generating Functions ‘The Minimal Polynomial Fans of Leas Recng Sequences ‘Chars of Linea Recurring Sequeness Distibuion Proper of Liner Recuring Soqunses Evers ‘Theoret! Appiations of Fine Fis Fite Gaometric Combinatorics Lint Moduler Systems Prenorandom Sequences Ener Algbeaie Coding Theory Linear Codes Cycle Codes Goppe Codes Exess cryptology Background 210 ais 2m 2s 2s 2 2s m a an zs m 3 ono 2 Steam Ciphers 5 Discrete Logarthns 4 Funler Crypeosysens Baers ‘Tale, Computation a Fite Fils ‘ahls of Ineducibe Polynomials ibography sto Symbas Index Fey 360 3 38 m ao