Order Total (1 Item Items):
Shipping Destination:
Dirk Hachenberger (41 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (41)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (17)
- Not Print on Demand (33)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Mathematik für Informatiker (Pearson Studium - IT)
Language: German
ISBN 10: 3827371090 ISBN 13: 9783827371096
Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
-
Condition: acceptable. Ausreichend/Acceptable: Exemplar mit vollständigem Text und sämtlichen Abbildungen oder Karten. Schmutztitel oder Vorsatz können fehlen. Einband bzw. Schutzumschlag weisen unter Umständen starke Gebrauchsspuren auf. / Describes a book or dust jacket that has the complete text pages (including those with maps or plates) but may lack endpapers, half-title, etc. (which must be noted). Binding, dust jacket (if any), etc may also be worn.
-
Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.
-
Hardcover. Condition: As New. Leichte Abnutzungen.
-
Condition: As New. Unread book in perfect condition.
-
Mathematik für Informatiker.
Seller: Antiquariat Nam, UstId: DE164665634, Freiburg, Germany
Seller rating 5 out of 5 stars
527 S. Pbd. Einband wenig berieben, sonst sehr gut erhalten. dt.
-
Topics in Galois Fields (Algorithms and Computation in Mathematics, 29)
Book 1 of 24: Algorithms and Computation in MathematicsSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 57.30
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
Topics in Galois Fields
Book 1 of 24: Algorithms and Computation in MathematicsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Topics in Galois Fields
Book 1 of 24: Algorithms and Computation in MathematicsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Topics in Galois Fields
Book 1 of 24: Algorithms and Computation in MathematicsLanguage: English
Published by Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030608042 ISBN 13: 9783030608040
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. 1st ed. 2020. This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.
-
Condition: New. pp. XIV, 785 11 illus. 1 Edition NO-PA16APR2015-KAP.
-
Condition: New. pp. XIV, 785 11 illus.
-
Condition: New. pp. XIV, 785 11 illus.
-
-
Topics in Galois Fields
Book 1 of 24: Algorithms and Computation in MathematicsLanguage: English
Published by Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030608042 ISBN 13: 9783030608040
Hardback. Condition: New. 1st ed. 2020. This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.
-
Finite Fields: Normal Bases and Completely Free Elements (The Springer International Series in Engineering and Computer Science, 390)
Book 224 of 260: The Springer International Series in Engineering and Computer ScienceSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 134.60
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Finite Fields: Normal Bases and Completely Free Elements (The Springer International Series in Engineering and Computer Science)
Book 224 of 260: The Springer International Series in Engineering and Computer ScienceSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 134.30
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Hardcover. Condition: New. New. book.
-
Topics In Galois Fields
Book 1 of 24: Algorithms and Computation in MathematicsSeller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New.
-
Hardcover. Condition: Brand New. 799 pages. 9.25x6.10x1.69 inches. In Stock.
-
Condition: New. pp. 188.
-
Finite Fields
Book 224 of 260: The Springer International Series in Engineering and Computer ScienceLanguage: English
Published by Kluwer Academic Publishers, 1996
ISBN 10: 0792398513 ISBN 13: 9780792398516
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Over the years, normal bases in finite fields have been proved to be very useful for doing arithmetic computations. In addition to interest in arbitrary normal bases, this book examines a special class of normal bases whose existence has only been settled more recently. It serves as a reference for researchers in finite fields. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 171 pages, biography. BIC Classification: PBF. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 12. Weight in Grams: 980. . 1996. Hardback. . . . .
-
-
Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
-
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Finite Fields are fundamental structures of Discrete Mathematics. They serve as basic data structures in pure disciplines like Finite Geometries and Combinatorics, and also have aroused much interest in applied disciplines like Coding Theory and Cryptography. A look at the topics of the proceed ings volume of the Third International Conference on Finite Fields and Their Applications (Glasgow, 1995) (see [18]), or at the list of references in I. E. Shparlinski's book [47] (a recent extensive survey on the Theory of Finite Fields with particular emphasis on computational aspects), shows that the area of Finite Fields goes through a tremendous development. The central topic of the present text is the famous Normal Basis Theo rem, a classical result from field theory, stating that in every finite dimen sional Galois extension E over F there exists an element w whose conjugates under the Galois group of E over F form an F-basis of E (i. e. , a normal basis of E over F; w is called free in E over F). For finite fields, the Nor mal Basis Theorem has first been proved by K. Hensel [19] in 1888. Since normal bases in finite fields in the last two decades have been proved to be very useful for doing arithmetic computations, at present, the algorithmic and explicit construction of (particular) such bases has become one of the major research topics in Finite Field Theory.
-
Gebunden. Condition: New. Finite Fields are fundamental structures of Discrete Mathematics. They serve as basic data structures in pure disciplines like Finite Geometries and Combinatorics, and also have aroused much interest in applied disciplines like Coding Theory and Cryptograph.
-
-
Finite Fields
Book 224 of 260: The Springer International Series in Engineering and Computer ScienceLanguage: English
Published by Kluwer Academic Publishers, 1997
ISBN 10: 0792398513 ISBN 13: 9780792398516
Condition: New. Over the years, normal bases in finite fields have been proved to be very useful for doing arithmetic computations. In addition to interest in arbitrary normal bases, this book examines a special class of normal bases whose existence has only been settled more recently. It serves as a reference for researchers in finite fields. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 171 pages, biography. BIC Classification: PBF. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 12. Weight in Grams: 980. . 1996. Hardback. . . . . Books ship from the US and Ireland.
-
Finite Fields : Normal Bases and Completely Free Elements
Book 224 of 260: The Springer International Series in Engineering and Computer ScienceLanguage: English
Published by Springer Us Jan 1997, 1997
ISBN 10: 0792398513 ISBN 13: 9780792398516
Buch. Condition: Neu. Neuware - Finite Fields are fundamental structures of Discrete Mathematics. They serve as basic data structures in pure disciplines like Finite Geometries and Combinatorics, and also have aroused much interest in applied disciplines like Coding Theory and Cryptography. A look at the topics of the proceed ings volume of the Third International Conference on Finite Fields and Their Applications (Glasgow, 1995) (see [18]), or at the list of references in I. E. Shparlinski's book [47] (a recent extensive survey on the Theory of Finite Fields with particular emphasis on computational aspects), shows that the area of Finite Fields goes through a tremendous development. The central topic of the present text is the famous Normal Basis Theo rem, a classical result from field theory, stating that in every finite dimen sional Galois extension E over F there exists an element w whose conjugates under the Galois group of E over F form an F-basis of E (i. e. , a normal basis of E over F; w is called free in E over F). For finite fields, the Nor mal Basis Theorem has first been proved by K. Hensel [19] in 1888. Since normal bases in finite fields in the last two decades have been proved to be very useful for doing arithmetic computations, at present, the algorithmic and explicit construction of (particular) such bases has become one of the major research topics in Finite Field Theory.
