Menu
Rendelés állapotának ellenőrzése
Kapcsolat
Könyv Selected Unsolved Problems in Coding Theory David Joyner

Selected Unsolved Problems in Coding Theory

Szerző: David Joyner, Jon-Lark Kim
Nyelv: Angol
Kötés: Kemény kötésű
Kiadó: Birkhauser Boston Inc
Elérhetőség: Beszállítói készleten
Küldés 10-13 napon belül
19 305 Ft
Using an original mode of presentation, and emphasizing the computational nature of the subject, thi...

Információk a könyvről

Szerző
David Joyner, Jon-Lark Kim
Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2011
oldal
248
EAN
9780817682552
ISBN
0817682554
Enbook ID
01399528
Kiadó
Birkhauser Boston Inc
Súly
1060
Méretek
155 x 235 x 16

Teljes leírás

Using an original mode of presentation, and emphasizing the computational nature of the subject, this book explores a number of the unsolved problems that still exist in coding theory. A well-established, yet still highly relevant branch of mathematics, the theory of error-correcting codes is concerned with reliably transmitting data over a noisy channel. Despite its frequent use in a range of contexts the first close-up pictures of the surface of Mars, taken by the NASA spacecraft Mariner 9, were transmitted back to Earth using a Reed Muller code the subject still contains interesting unsolved problems that have resisted solution by some of the most prominent mathematicians of recent decades.§Employing Sage a free open-source mathematics software system to illustrate their ideas, the authors begin by providing background on linear block codes and introducing some of the special families of codes explored in later chapters, such as quadratic residue and algebraic-geometric codes. Also surveyed is the theory that intersects self-dual codes, lattices, and invariant theory, which leads to an intriguing analogy between the Duursma zeta function and the zeta function attached to an algebraic curve over a finite field. The authors then examine a connection with the theory of block designs and the Assmus Mattson theorem. Further chapters scrutinize the knotty problem of finding a non-trivial estimate for the number of solutions over a finite field to a hyperelliptic polynomial equation of "small" degree, as well as the best asymptotic bounds for a binary linear block code. Some of the more mysterious aspects relating modular forms and algebraic-geometric codes are also discussed.§Selected Unsolved Problems in Coding Theory is intended for graduate students and researchers in algebraic coding theory, especially those who are interested in finding some current unsolved problems. Familiarity with concepts in algebra, number theory, and modular forms is assumed. The work may be used as supplementary reading material in a graduate course on coding theory or for self-study.

Érdekelheti

Textbook of Critical Care

Jean-Louis Vincent
97 057 Ft

Caravaggio

Stefano Zuffi
12 768 Ft

Apple That Astonished Paris

Billy Collins
6 070 Ft

WOMEN S WRITING IN ENGLISH CONTEMPORARH

Patricia Demers
29 159 Ft

Civilization

Niall Ferguson
5 985 Ft

Honduras: A Pariah State, or Innovative Solutions to Organized Crime Deserving U.S. Support?

R. Evan Ellis
8 984 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Von Spatz

Anna Haifisch
6 129 Ft

Tribunal de Commerce de Toulouse. Rapport Sur Le Projet de Loi Relatif Aux Faillites

CHASSAING
5 062 Ft

Propósitos

Pedro J. Herrero
6 554 Ft

Administrativos de la Junta de Andalucía. Promoción Interna. Temario. Volumen II

Desongles Corrales
9 738 Ft

In letzter Sekunde

Lee Child
4 434 Ft