Information and Coding Theory: Springer Undergraduate Mathematics Series
Autor Gareth A. Jones, J. Mary Jonesen Limba Engleză Paperback – 26 iun 2000
Din seria Springer Undergraduate Mathematics Series
-
Preț: 413.52 lei -
Preț: 367.19 lei - 13%
Preț: 403.43 lei - 13%
Preț: 469.26 lei -
Preț: 257.34 lei -
Preț: 400.00 lei -
Preț: 184.63 lei -
Preț: 373.88 lei -
Preț: 334.04 lei -
Preț: 422.57 lei - 20%
Preț: 363.33 lei -
Preț: 396.11 lei -
Preț: 322.75 lei -
Preț: 312.83 lei -
Preț: 264.32 lei - 15%
Preț: 506.44 lei -
Preț: 261.80 lei -
Preț: 258.96 lei -
Preț: 256.63 lei -
Preț: 255.26 lei -
Preț: 319.05 lei -
Preț: 184.89 lei -
Preț: 263.40 lei -
Preț: 264.69 lei -
Preț: 263.17 lei -
Preț: 254.58 lei -
Preț: 259.74 lei -
Preț: 260.53 lei -
Preț: 267.10 lei -
Preț: 258.62 lei - 15%
Preț: 227.61 lei -
Preț: 266.36 lei -
Preț: 265.15 lei -
Preț: 269.96 lei -
Preț: 259.16 lei -
Preț: 264.93 lei -
Preț: 311.68 lei -
Preț: 267.48 lei -
Preț: 263.55 lei -
Preț: 262.07 lei -
Preț: 257.20 lei -
Preț: 262.14 lei -
Preț: 258.55 lei -
Preț: 249.76 lei -
Preț: 254.70 lei -
Preț: 260.39 lei -
Preț: 258.90 lei -
Preț: 264.25 lei -
Preț: 263.40 lei
Preț: 180.25 lei
Puncte Express: 270
Carte indisponibilă temporar
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9781852336226
ISBN-10: 1852336226
Pagini: 228
Ilustrații: XIII, 210 p. 5 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:2000
Editura: Springer
Colecția Springer Undergraduate Mathematics Series
Seria Springer Undergraduate Mathematics Series
Locul publicării:London, United Kingdom
ISBN-10: 1852336226
Pagini: 228
Ilustrații: XIII, 210 p. 5 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:2000
Editura: Springer
Colecția Springer Undergraduate Mathematics Series
Seria Springer Undergraduate Mathematics Series
Locul publicării:London, United Kingdom
Public țintă
Lower undergraduateCuprins
1. Source Coding.- 1.1 Definitions and Examples.- 1.2 Uniquely Decodable Codes.- 1.3 Instantaneous Codes.- 1.4 Constructing Instantaneous Codes.- 1.5 Kraft’s Inequality.- 1.6 McMillan’s Inequality.- 1.7 Comments on Kraft’s and McMillan’s Inequalities.- 1.8 Supplementary Exercises.- 2. Optimal Codes.- 2.1 Optimality.- 2.2 Binary Huffman Codes.- 2.3 Average Word-length of Huffman Codes.- 2.4 Optimality of Binary Huffman Codes.- 2.5 r-ary Huffman Codes.- 2.6 Extensions of Sources.- 2.7 Supplementary Exercises.- 3. Entropy.- 3.1 Information and Entropy.- 3.2 Properties of the Entropy Function.- 3.3 Entropy and Average Word-length.- 3.4 Shannon-Fano Coding.- 3.5 Entropy of Extensions and Products.- 3.6 Shannon’s First Theorem.- 3.7 An Example of Shannon’s First Theorem.- 3.8 Supplementary Exercises.- 4. Information Channels.- 4.1 Notation and Definitions.- 4.2 The Binary Symmetric Channel.- 4.3 System Entropies.- 4.4 System Entropies for the Binary Symmetric Channel.- 4.5 Extension of Shannon’s First Theorem to Information Channels.- 4.6 Mutual Information.- 4.7 Mutual Information for the Binary Symmetric Channel.- 4.8 Channel Capacity.- 4.9 Supplementary Exercises.- 5. Using an Unreliable Channel.- 5.1 Decision Rules.- 5.2 An Example of Improved Reliability.- 5.3 Hamming Distance.- 5.4 Statement and Outline Proof of Shannon’s Theorem.- 5.5 The Converse of Shannon’s Theorem.- 5.6 Comments on Shannon’s Theorem.- 5.7 Supplementary Exercises.- 6. Error-correcting Codes.- 6.1 Introductory Concepts.- 6.2 Examples of Codes.- 6.3 Minimum Distance.- 6.4 Hamming’s Sphere-packing Bound.- 6.5 The Gilbert-Varshamov Bound.- 6.6 Hadamard Matrices and Codes.- 6.7 Supplementary Exercises.- 7. Linear Codes.- 7.1 Matrix Description of Linear Codes.- 7.2 Equivalence ofLinear Codes.- 7.3 Minimum Distance of Linear Codes.- 7.4 The Hamming Codes.- 7.5 The Golay Codes.- 7.6 The Standard Array.- 7.7 Syndrome Decoding.- 7.8 Supplementary Exercises.- Suggestions for Further Reading.- Appendix A. Proof of the Sardinas-Patterson Theorem.- Appendix B. The Law of Large Numbers.- Appendix C. Proof of Shannon’s Fundamental Theorem.- Solutions to Exercises.- Index of Symbols and Abbreviations.
Caracteristici
Written by the authors of "Elementary Number Theory", a hugely popular SUMS title Information and Coding Theory are increasingly popular topics in undergraduate curricula: this is the first book to cover both topics in-depth in one volume Includes supplementary material: sn.pub/extras