Introduction to Coding Theory: Graduate Texts in Mathematics, cartea 86
Autor J. H. van Linten Limba Engleză Paperback – 14 oct 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 525.35 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 14 oct 2012 | 525.35 lei 6-8 săpt. | |
Hardback (1) | 700.61 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 15 dec 1998 | 700.61 lei 6-8 săpt. |
Din seria Graduate Texts in Mathematics
- Preț: 337.45 lei
- 17% Preț: 528.66 lei
- Preț: 383.85 lei
- Preț: 402.87 lei
- 17% Preț: 398.97 lei
- Preț: 355.82 lei
- Preț: 411.83 lei
- Preț: 404.47 lei
- Preț: 289.88 lei
- 17% Preț: 365.79 lei
- 17% Preț: 359.45 lei
- Preț: 450.64 lei
- 15% Preț: 488.70 lei
- 17% Preț: 430.49 lei
- 13% Preț: 357.75 lei
- Preț: 407.88 lei
- 13% Preț: 352.49 lei
- 13% Preț: 358.86 lei
- 13% Preț: 393.48 lei
- 11% Preț: 351.00 lei
- 17% Preț: 359.58 lei
- Preț: 350.45 lei
- Preț: 400.27 lei
- Preț: 498.91 lei
- 20% Preț: 571.26 lei
- 15% Preț: 546.59 lei
- Preț: 498.69 lei
- 15% Preț: 354.39 lei
- Preț: 313.10 lei
- 13% Preț: 427.39 lei
- 17% Preț: 363.59 lei
- Preț: 340.18 lei
- 17% Preț: 364.47 lei
- 17% Preț: 366.47 lei
- 17% Preț: 366.06 lei
- Preț: 247.59 lei
- 17% Preț: 367.70 lei
- 13% Preț: 356.79 lei
- 17% Preț: 398.78 lei
- 17% Preț: 398.51 lei
- 17% Preț: 496.63 lei
- 15% Preț: 482.97 lei
- Preț: 401.99 lei
- 17% Preț: 366.56 lei
- 20% Preț: 449.73 lei
- Preț: 380.34 lei
- Preț: 364.79 lei
- 17% Preț: 427.27 lei
- Preț: 357.19 lei
Preț: 525.35 lei
Preț vechi: 618.05 lei
-15% Nou
Puncte Express: 788
Preț estimativ în valută:
100.55€ • 104.58$ • 84.26£
100.55€ • 104.58$ • 84.26£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642636530
ISBN-10: 3642636535
Pagini: 252
Ilustrații: XIV, 234 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:3rd ed. 1999. Softcover reprint of the original 3rd ed. 1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Graduate Texts in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642636535
Pagini: 252
Ilustrații: XIV, 234 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:3rd ed. 1999. Softcover reprint of the original 3rd ed. 1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Graduate Texts in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
GraduateCuprins
1 Mathematical Background.- 1.1. Algebra.- 1.2. Krawtchouk Polynomials.- 1.3. Combinatorial Theory.- 1.4. Probability Theory.- 2 Shannon’s Theorem.- 2.1. Introduction.- 2.2. Shannon’s Theorem.- 2.3. On Coding Gain.- 2.4. Comments.- 2.5. Problems.- 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. The Lee Metric.- 3.7. Comments.- 3.8. Problems.- 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.- 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.- 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. Binary Cyclic Codes of Length 2n(n odd).- 6.11. Generalized Reed—Muller Codes.- 6.12. Comments.- 6.13. Problems.- 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.- 8 Codes over ?4.- 8.1. Quaternary Codes.- 8.2. Binary Codes Derived from Codes over ?4.- 8.3. Galois Rings over ?4.- 8.4. Cyclic Codes over ?4.- 8.5. Problems.- 9 Goppa Codes.- 9.1. Motivation.- 9.2. Goppa Codes.- 9.3. The Minimum Distance of Goppa Codes.- 9.4. Asymptotic Behaviour of Goppa Codes.- 9.5. Decoding Goppa Codes.- 9.6. Generalized BCH Codes.- 9.7. Comments.- 9.8. Problems.- 10 Algebraic Geometry Codes.- 10.1. Introduction.- 10.2. Algebraic Curves.- 10.3. Divisors.- 10.4. Differentials on a Curve.- 10.5. The Riemann—Roch Theorem.- 10.6. Codes from Algebraic Curves.- 10.7. Some Geometric Codes.- 10.8. Improvement of the Gilbert—Varshamov Bound.- 10.9. Comments.- 10.10.Problems.- 11 Asymptotically Good Algebraic Codes.- 11.1. A Simple Nonconstructive Example.- 11.2. Justesen Codes.- 11.3. Comments.- 11.4. Problems.- 12 Arithmetic Codes.- 12.1. AN Codes.- 12.2. The Arithmetic and Modular Weight.- 12.3. Mandelbaum—Barrows Codes.- 12.4. Comments.- 12.5. Problems.- 13 Convolutional Codes.- 13.1. Introduction.- 13.2. Decoding of Convolutional Codes.- 13.3. An Analog of the Gilbert Bound for Some Convolutional Codes.- 13.4. Construction of Convolutional Codes from Cyclic Block Codes.- 13.5. Automorphisms of Convolutional Codes.- 13.6. Comments.- 13.7. Problems.- Hints and Solutions to Problems.- References.