The Resource A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen
A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen
Resource Information
The item A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.This item is available to borrow from 1 library branch.
Resource Information
The item A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.
This item is available to borrow from 1 library branch.
- Summary
- This guide provides an introduction to the engineering background of modern communication systems, from mobile phones to data compression and storage. The authors begin with many practical applications in coding, including the repetition code, the Hamming code and the Huffman code. They then explain the corresponding information theory, from entropy and mutual information to channel capacity and the information transmission theorem. Finally, they provide insights into the connections between coding theory and other fields. Many worked examples are given throughout the book, using practical applications to illustrate theoretical definitions. Exercises are also included, enabling readers to double-check what they have learned and gain glimpses into more advanced topics.--
- Language
- eng
- Extent
- xiii, 191 pages
- Contents
-
- 1. Introduction
- Information theory versus coding theory
- Model and basic operations of information processing systems
- Information source
- Encoding a source alphabet
- Octal and hexadecimal codes
- 2. Error-detecting codes
- Review of modular arithmetic
- Independent errors : white noise
- Single parity-check code
- The ASCII code
- Simple burst error-detecting code
- Alphabet plus number codes : weighted codes
- Trade-off between redundancy and error-detecting capability
- 3. Repetition and hamming codes
- Arithmetic in the binary field
- Three-times repetition code
- Hamming code
- Hamming bound : sphere packing
- 4. Data compression: efficient coding of a random message
- Prefix-free or instantaneous codes
- Trees and codes
- The Kraft Inequality
- Trees with probabilities
- Optimal codes : Huffman code
- Types of codes
- 5. Entropy and Shannon's source coding theorem
- Motivation
- Uncertainty or entropy
- Binary entropy function
- Information Theory Inequality
- Bounds on the entropy
- Trees revisited
- Bounds on the efficiency of codes
- Fundamental limitations of source coding
- Analysis of the best codes
- Coding Theorem for a single random message
- Coding of an information source
- Appendix : Uniqueness of the definition of entropy
- 6. Mutual information and channel capacity
- The channel
- The channel relationships
- The binary symmetric channel
- System entropies
- Mutual information
- Definition of channel capacity
- Capacity of the binary symmetric channel
- Uniformly dispersive channel
- Characterization of the capacity-achieving input distribution
- Shannon's Channel Coding Theorem
- 7. Approaching the Shannon limit by turbo coding
- Information Transmission Theorem
- The Gaussian channel
- Transmission at a rate below capacity
- Transmission at a rate above capacity
- Turbo coding
- Appendix : Why we assume uniform and independent data at the encoder
- Appendix : Definition of concavity
- 8. Other aspects of coding theory
- Hamming code and projective geometry
- Coding and game theory
- Isbn
- 9781107015838
- Label
- A student's guide to coding and information theory
- Title
- A student's guide to coding and information theory
- Statement of responsibility
- Stefan M. Moser, Po-Ning Chen
- Language
- eng
- Summary
- This guide provides an introduction to the engineering background of modern communication systems, from mobile phones to data compression and storage. The authors begin with many practical applications in coding, including the repetition code, the Hamming code and the Huffman code. They then explain the corresponding information theory, from entropy and mutual information to channel capacity and the information transmission theorem. Finally, they provide insights into the connections between coding theory and other fields. Many worked examples are given throughout the book, using practical applications to illustrate theoretical definitions. Exercises are also included, enabling readers to double-check what they have learned and gain glimpses into more advanced topics.--
- Assigning source
- Provided by Publisher
- Cataloging source
- NLE
- http://library.link/vocab/creatorName
- Moser, Stefan M
- Illustrations
- illustrations
- Index
- index present
- Literary form
- non fiction
- Nature of contents
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Chen, Po-Ning
- http://library.link/vocab/subjectName
-
- Coding theory
- Information theory
- Label
- A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier.
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent.
- Contents
- 1. Introduction -- Information theory versus coding theory -- Model and basic operations of information processing systems -- Information source -- Encoding a source alphabet -- Octal and hexadecimal codes -- 2. Error-detecting codes -- Review of modular arithmetic -- Independent errors : white noise -- Single parity-check code -- The ASCII code -- Simple burst error-detecting code -- Alphabet plus number codes : weighted codes -- Trade-off between redundancy and error-detecting capability -- 3. Repetition and hamming codes -- Arithmetic in the binary field -- Three-times repetition code -- Hamming code -- Hamming bound : sphere packing -- 4. Data compression: efficient coding of a random message -- Prefix-free or instantaneous codes -- Trees and codes -- The Kraft Inequality -- Trees with probabilities -- Optimal codes : Huffman code -- Types of codes -- 5. Entropy and Shannon's source coding theorem -- Motivation -- Uncertainty or entropy -- Binary entropy function -- Information Theory Inequality -- Bounds on the entropy -- Trees revisited -- Bounds on the efficiency of codes -- Fundamental limitations of source coding -- Analysis of the best codes -- Coding Theorem for a single random message -- Coding of an information source -- Appendix : Uniqueness of the definition of entropy -- 6. Mutual information and channel capacity -- The channel -- The channel relationships -- The binary symmetric channel -- System entropies -- Mutual information -- Definition of channel capacity -- Capacity of the binary symmetric channel -- Uniformly dispersive channel -- Characterization of the capacity-achieving input distribution -- Shannon's Channel Coding Theorem -- 7. Approaching the Shannon limit by turbo coding -- Information Transmission Theorem -- The Gaussian channel -- Transmission at a rate below capacity -- Transmission at a rate above capacity -- Turbo coding -- Appendix : Why we assume uniform and independent data at the encoder -- Appendix : Definition of concavity -- 8. Other aspects of coding theory -- Hamming code and projective geometry -- Coding and game theory
- Control code
- FIEb17819593
- Dimensions
- 23 cm.
- Extent
- xiii, 191 pages
- Isbn
- 9781107015838
- Media category
- unmediated
- Media MARC source
- rdamedia.
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
- (OCoLC)778123334
- Label
- A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier.
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent.
- Contents
- 1. Introduction -- Information theory versus coding theory -- Model and basic operations of information processing systems -- Information source -- Encoding a source alphabet -- Octal and hexadecimal codes -- 2. Error-detecting codes -- Review of modular arithmetic -- Independent errors : white noise -- Single parity-check code -- The ASCII code -- Simple burst error-detecting code -- Alphabet plus number codes : weighted codes -- Trade-off between redundancy and error-detecting capability -- 3. Repetition and hamming codes -- Arithmetic in the binary field -- Three-times repetition code -- Hamming code -- Hamming bound : sphere packing -- 4. Data compression: efficient coding of a random message -- Prefix-free or instantaneous codes -- Trees and codes -- The Kraft Inequality -- Trees with probabilities -- Optimal codes : Huffman code -- Types of codes -- 5. Entropy and Shannon's source coding theorem -- Motivation -- Uncertainty or entropy -- Binary entropy function -- Information Theory Inequality -- Bounds on the entropy -- Trees revisited -- Bounds on the efficiency of codes -- Fundamental limitations of source coding -- Analysis of the best codes -- Coding Theorem for a single random message -- Coding of an information source -- Appendix : Uniqueness of the definition of entropy -- 6. Mutual information and channel capacity -- The channel -- The channel relationships -- The binary symmetric channel -- System entropies -- Mutual information -- Definition of channel capacity -- Capacity of the binary symmetric channel -- Uniformly dispersive channel -- Characterization of the capacity-achieving input distribution -- Shannon's Channel Coding Theorem -- 7. Approaching the Shannon limit by turbo coding -- Information Transmission Theorem -- The Gaussian channel -- Transmission at a rate below capacity -- Transmission at a rate above capacity -- Turbo coding -- Appendix : Why we assume uniform and independent data at the encoder -- Appendix : Definition of concavity -- 8. Other aspects of coding theory -- Hamming code and projective geometry -- Coding and game theory
- Control code
- FIEb17819593
- Dimensions
- 23 cm.
- Extent
- xiii, 191 pages
- Isbn
- 9781107015838
- Media category
- unmediated
- Media MARC source
- rdamedia.
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
- (OCoLC)778123334
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.eui.eu/portal/A-students-guide-to-coding-and-information/uRvRPH2hnVc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/A-students-guide-to-coding-and-information/uRvRPH2hnVc/">A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.eui.eu/portal/A-students-guide-to-coding-and-information/uRvRPH2hnVc/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/A-students-guide-to-coding-and-information/uRvRPH2hnVc/">A student's guide to coding and information theory, Stefan M. Moser, Po-Ning Chen</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</a></span></span></span></span></div>