9780192690678 - Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) de Pretzel, Oliver (27 resultados)

Paperback. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Soft cover. Condición: Very good. No jacket. Very good condition, clean and unmarked inside. One small stamp on bottom edge of pages, light handling wear.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New. In.

PF. Condición: New.

Condición: New.

Paperback. Condición: New. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves.

Condición: As New. Unread book in perfect condition.

Condición: New. This edition is an unabridged reprint of chapters one to 20 of the original hardback edition. It starts with the elementary ideas of parity check codes and goes on to explain the theory of finite fields, BCH and Reed-Solomon codes. The mathematics is developed in parallel with the applications. Series: Oxford Applied Mathematics & Computing Science Series. Num Pages: 356 pages, line figures, tables. BIC Classification: GPF; PDE; TBJ. Category: (U) Tertiary Education (US: College). Dimension: 232 x 155 x 24. Weight in Grams: 514. . 2002. Student ed. paperback. . . . .

Condición: New. This edition is an unabridged reprint of chapters one to 20 of the original hardback edition. It starts with the elementary ideas of parity check codes and goes on to explain the theory of finite fields, BCH and Reed-Solomon codes. The mathematics is developed in parallel with the applications. Series: Oxford Applied Mathematics & Computing Science Series. Num Pages: 356 pages, line figures, tables. BIC Classification: GPF; PDE; TBJ. Category: (U) Tertiary Education (US: College). Dimension: 232 x 155 x 24. Weight in Grams: 514. . 2002. Student ed. paperback. . . . . Books ship from the US and Ireland.

Condición: Gut. Zustand: Gut | Seiten: 360 | Sprache: Englisch | Produktart: Bücher | This book provides engineers and computer scientists with all the tools necessary to implement modern error-processing techniques. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The first part introduces the basic ideas of coding theory. The second and third cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature is a simplified (but rigorous) treatment of the geometry of curves.

Paperback. Condición: New. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves.

Paperback. Condición: Like New. Like New. book.

PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Condición: new. Questo è un articolo print on demand.

Paperback. Condición: new. Paperback. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory.The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finitefields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, bothclassical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Condición: new. Paperback. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finitefields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, bothclassical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Paperback. Condición: new. Paperback. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory.The book is in four parts. The first introduces the basic ideas of coding theory. The second and third parts cover the theory of finitefields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their use of Euclid's algorithm as a central technique. The fourth part is devoted to Goppa codes, bothclassical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature of this part is a simplified (but rigorous) treatment of the geometry of curves. This book provides the reader with all the tools necessary to implement modern error-processing schemes. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condición: New. Print on Demand pp. 360.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This edition is an unabridged reprint of chapters one to 20 of the original hardback edition. It starts with the elementary ideas of parity check codes and goes on to explain the theory of finite fields, BCH and Reed-Solomon codes. The mathematics is develo.

Condición: New. Print on Demand pp. 360 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 360.

Taschenbuch. Condición: Neu. Error-Correcting Codes and Finite Fields | Oliver Pretzel | Taschenbuch | Kartoniert / Broschiert | Englisch | 1996 | OUP Oxford | EAN 9780192690678 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book provides engineers and computer scientists with all the tools necessary to implement modern error-processing techniques. It assumes only a basic knowledge of linear algebra and develops the mathematical theory in parallel with the codes. Central to the text are worked examples which motivate and explain the theory. The first part introduces the basic ideas of coding theory. The second and third cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. The fourth part is devoted to Goppa codes, both classical and geometric, concluding with the Skorobogatov-Vladut error processor. A special feature is a simplified (but rigorous) treatment of the geometry of curves.