Name: Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) (en Inglés)
SKU: 19174214
Price: 126.91 USD
Availability: InStock
Author: Oliver Pretzel
ISBN: 9780192690678

portada Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) (en Inglés)

Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) (en Inglés)

Formato

Libro Físico

Editorial

Oxford University Press

Autor

Oliver Pretzel

Año

1996

Idioma

Inglés

N° páginas

360

Encuadernación

Tapa Blanda

ISBN

0192690671

ISBN13

9780192690678

Categorías

Ciencias de la computación

Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) (en Inglés)

Oliver Pretzel (Autor) · Oxford University Press · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 22 días háb.

$ 253.82$ 126.91

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 50 unidades

$ 126.91

Llega entre el 22 Sep y el 02 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Error-Correcting Codes and Finite Fields. Student Edition (Oxford Applied Mathematics and Computing Science Series) (en Inglés)"

This textbook is a reprint of Chapters 1-20 of the original hardback edition. It provides the reader with the tools necessary to implement modern error-processing schemes. The material on algebraic geometry and geometric Goppa codes, which is not part of a standard introductory course on coding theory, has been omitted. The book 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 cover the theory of finite fields and give a detailed treatment of BCH and Reed-Solomon codes. These parts are linked by their uses of Eulid's algorithm as a central technique. The fourth part treats classical Goppa codes.