S'està carregant…

Introduction to Coding Theory

de J. H. van Lint

Membres	Ressenyes	Popularitat	Valoració mitjana	Converses
36	1	680,560	(3.25)	Cap
It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have used the opportunity to improve and enlarge the book. When the second edition was prepared, only two pages on algebraic geometry codes were added. These have now been removed and replaced by a relatively long chapter on this subject. Although it is still only an introduction, the chapter requires more mathematical background of the reader than the remainder of this book. One of the very interesting recent developments concerns binary codes defined by using codes over the alphabet 7l.4* There is so much interest in this area that a chapter on the essentials was added. Knowledge of this chapter will allow the reader to study recent literature on 7l. -codes. 4 Furthermore, some material has been added that appeared in my Springer Lec ture Notes 201, but was not included in earlier editions of this book, e. g. Generalized Reed-Solomon Codes and Generalized Reed-Muller Codes. In Chapter 2, a section on "Coding Gain" ( the engineer's justification for using error-correcting codes) was added. For the author, preparing this third edition was a most welcome return to mathematics after seven years of administration. For valuable discussions on the new material, I thank C.P.l.M.Baggen, I. M.Duursma, H.D.L.Hollmann, H. C. A. van Tilborg, and R. M. Wilson. A special word of thanks to R. A. Pellikaan for his assistance with Chapter 10.… (més)

tots els membres

▾Membres

Afegit fa poc per

apalmer2018, ameen2, AFloridaReader, 2v, Jean_R, morphismus, filipkos, Atulkumbhar

▾Etiquetes

Traducció d'etiquetes activa

▾Recomanacions de LibraryThing

▾Llistes

Cap

▾T'agradarà?

S'està carregant…

Apunta't a LibraryThing per saber si aquest llibre et pot agradar.

▾Converses (Enllaços)

No hi ha cap discussió a Converses sobre aquesta obra.

▾Ressenyes dels membres

Indeholder "Preface", "Chapter 1. Mathematical Background", " 1.1 Algebra", " 1.2 Krawtchouk Polynomials", " 1.3 Combinatorial Theory", " 1.4 Probability Theory", "Chapter 2. Shannon's Theorem", " 2.1 Introduction", " 2.2 Shannon's Theorem", " 2.3 Comments", " 2.4 Problems", "Chapter 3. Linear Codes", " 3.1 Block Codes", " 3.2 Linear Codes", " 3.3 Hamming Codes", " 3.4 Majority Logic Decoding", " 3.5 Weight Enumerators", " 3.6 Comments", " 3.7 Problems", "Chapter 4. Some Good Codes", " 4.1 Hadamard Codes and Generalizations", " 4.2 The Binary Golay Code", " 4.3 The Ternary Golay Code", " 4.4 Constructing Codes from Other Codes", " 4.5 Reed-Muller Codes", " 4.6 Kerdock Codes", " 4.7 Comments", " 4.8 Problems", "Chapter 5. Bounds on Codes", " 5.1 Introduction: The Gilbert Bound", " 5.2 Upper Bounds", " 5.3 The Linear Programming Bound", " 5.4 Comments", " 5.5 Problems", "Chapter 6. Cyclic Codes", " 6.1 Definitions", " 6.2 Generator Matrix and Check Polynomial", " 6.3 Zeros of a Cyclic Code", " 6.4 The Idempotent of a Cyclic Code", " 6.5 Other Representations of Cyclic Codes", " 6.6 BCH Codes", " 6.7 Decoding BCH Codes", " 6.8 Reed-Solomon Codes", " 6.9 Quadratic Residue Codes", " 6.10 Comments", " 6.11 Problems", "Chapter 7. Perfect Codes and Uniformly Packed Codes", " 7.1 Lloyd's Theorem", " 7.2 The Characteristic Polynomial of a Code", " 7.3 Uniformly Packed Codes", " 7.4 Examples of Uniformly Packed Codes", " 7.5 Nonexistence Theorems", " 7.6 Comments", " 7.7 Problems", "Chapter 8. Goppa Codes", " 8.1 Motivation", " 8.2 Goppa Codes", " 8.3 The Minimum Distance of Goppa Codes", " 8.4 Asymptotic Behaviour of Goppa Codes", " 8.5 Decoding Goppa Codes", " 8.6 Generalized BCH Codes", " 8.7 Comments", " 8.8 Problems", "Chapter 9. Asymptotically Good Algebraic Codes", " 9.1 A Simple Nonconstructive Example", " 9.2 Justesen Codes", " 9.3 Comments", " 9.4 Problems", "Chapter 10. Arithmetic Codes", " 10.1 AN Codes", " 10.2 The Arithmetic and Modular Weight", " 10.3 Mandelbaum-Barrows Codes", " 10.4 Comments", " 10.5 Problems", "Chapter 11. Convolutional Codes", " 11.1 Introduction", " 11.2 Decoding of Convolutional Codes", " 11.3 An Analog of the Gilbert Bound for Some Convolutional Codes", " 11.4 Construction of Convolutional Codes from Cyclic Block Codes", " 11.5 Automorphisms of Convolutional Codes", " 11.6 Comments", " 11.7 Problems", "Hints and Solutions to Problems", "References", "Index".

Glimrende lærebog, men der er kommet mindst een nyere udgave. Det her er førsteudgaven fra juli 1981. (

)

bnielsen | Sep 26, 2016 |

▾Ressenyes publicades

Sense ressenyes | afegeix-hi una ressenya

▾Altres autors

» Afegeix-hi altres autors

▾Relacions entre sèries i obres

Pertany a aquestes col·leccions editorials

Graduate Texts in Mathematics (86)

▾Premis i honors

mostra l'historial

▾Coneixement comú

Has d'iniciar sessió per poder modificar les dades del coneixement compartit.

Si et cal més ajuda, mira la pàgina d'ajuda del coneixement compartit.

Títol normalitzat

Informació del coneixement compartit en anglès. Modifica-la per localitzar-la a la teva llengua.

Introduction to Coding Theory

Títol original

Títols alternatius

Data original de publicació

Gent/Personatges

Llocs importants

Esdeveniments importants

Pel·lícules relacionades

Epígraf

Dedicatòria

Primeres paraules

Citacions

Darreres paraules

Nota de desambiguació

Editor de l'editorial

Creadors de notes promocionals a la coberta

Llengua original

CDD/SMD canònics

LCC canònic

▾Referències

Referències a aquesta obra en fonts externes.

Wikipedia en anglès (13)

Enumerator polynomial

Graduate Texts in Mathematics

▾Descripcions del llibre

It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have used the opportunity to improve and enlarge the book. When the second edition was prepared, only two pages on algebraic geometry codes were added. These have now been removed and replaced by a relatively long chapter on this subject. Although it is still only an introduction, the chapter requires more mathematical background of the reader than the remainder of this book. One of the very interesting recent developments concerns binary codes defined by using codes over the alphabet 7l.4* There is so much interest in this area that a chapter on the essentials was added. Knowledge of this chapter will allow the reader to study recent literature on 7l. -codes. 4 Furthermore, some material has been added that appeared in my Springer Lec ture Notes 201, but was not included in earlier editions of this book, e. g. Generalized Reed-Solomon Codes and Generalized Reed-Muller Codes. In Chapter 2, a section on "Coding Gain" ( the engineer's justification for using error-correcting codes) was added. For the author, preparing this third edition was a most welcome return to mathematics after seven years of administration. For valuable discussions on the new material, I thank C.P.l.M.Baggen, I. M.Duursma, H.D.L.Hollmann, H. C. A. van Tilborg, and R. M. Wilson. A special word of thanks to R. A. Pellikaan for his assistance with Chapter 10.

▾Descripcions provinents de biblioteques

No s'han trobat descripcions de biblioteca.

▾Descripció dels membres de LibraryThing

Descripció del llibre

Sumari haiku