Buy Fundamentals of Information Theory and Coding Design
close menu
Bookswagon
search
My Account
Home > Computer Science Books > Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)
Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)

Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Books on information theory and coding have proliferated over the last few years, but few succeed in covering the fundamentals without losing students in mathematical abstraction. Even fewer build the essential theoretical framework when presenting algorithms and implementation details of modern coding systems.

Without abandoning the theoretical foundations, Fundamentals of Information Theory and Coding Design presents working algorithms and implementations that can be used to design and create real systems. The emphasis is on the underlying concepts governing information theory and the mathematical basis for modern coding systems, but the authors also provide the practical details of important codes like Reed-Solomon, BCH, and Turbo codes. Also setting this text apart are discussions on the cascading of information channels and the additivity of information, the details of arithmetic coding, and the connection between coding of extensions and Markov modelling.

Complete, balanced coverage, an outstanding format, and a wealth of examples and exercises make this an outstanding text for upper-level students in computer science, mathematics, and engineering and a valuable reference for telecommunications engineers and coding theory researchers.

Table of Contents:
ENTROPY AND INFORMATION
Structure
Structure in Randomness
First Concepts of Probability Theory
Surprise and Entropy
Units of Entropy
The Minimum and Maximum Values of Entropy
A Useful Inequality
Joint Probability Distribution Functions
Conditional Probability and Bayes' Theorem
Conditional Probability Distributions and Conditional Entropy
Information Sources
Memoryless Information Sources
Markov Sources and n-Gram Models
Stationary Distributions
The Entropy of Markov Sources
Sequences of Symbols
The Adjoint Source of a Markov Source
Extensions of Sources
Infinite Sample Spaces
INFORMATION CHANNELS
What Are Information Channels?
BSC and BEC Channels
Mutual Information
Noiseless and Deterministic Channels
Cascaded Channels
Additivity of Mutual Information
Channel Capacity: Maximum Mutual Information
Continuous Channels and Gaussian Channels
Information Capacity Theorem
Rate Distortion Theory
SOURCE CODING
Introduction
Instantaneous Codes
The Kraft Inequality and McMillan's Theorem
Average Length and Compact Codes
Shannon's Noiseless Coding Theorem
Fano Coding
Huffman Coding
Arithmetic Coding
Higher-Order Modelling
DATA COMPRESSION
Introduction
Basic Concepts of Data Compression
Run-Length Coding
The CCITT Standard for Facsimile Transmission
Block-sorting Compression
Dictionary Coding
Statistical Compression
Prediction by Partial Matching
Image Coding
FUNDAMENTALS OF CHANNEL CODING
Introduction
Code Rate
Decoding Rules
Hamming Distance
Bounds on M, Maximal Codes and Perfect Codes
Error Probabilities
Shannon's Fundamental Coding Theorem
ERROR-CORRECTING CODES
Introduction
Groups
Rings and Fields
Linear Spaces
Linear Spaces over the Binary Field
Linear Codes
Encoding and Decoding
Codes Derived from Hadamard Matrices
CYCLIC CODES
Introduction
Rings of Polynomials
Cyclic Codes
Encoding and Decoding of Cyclic Codes
Encoding and Decoding Circuits for Cyclic Codes
The Golay Code
Hamming Codes
Cyclic Redundancy Check Codes
Reed-Muller Codes
BURST-CORRECTING CODES
Introduction
Finite Fields
Irreducible Polynomials
Construction of Finite Fields
Bursts of Errors
Fire Codes
Minimum Polynomials
Bose-Chaudhuri-Hocquenghem Codes
Other Fields
Reed-Solomon Codes
CONVOLUTIONAL CODES
Introduction
ASimple Example
Binary Convolutional Codes
Decoding Convolutional Codes
The Viterbi Algorithm
Sequential Decoding
Trellis Modulation
Turbo Codes
INDEX

Each chapter also contains a section of exercises and a section of references.


Best Sellers


Product Details
  • ISBN-13: 9781135441869
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Chapman and Hall
  • Language: English
  • No of Pages: 385
  • ISBN-10: 1135441863
  • Publisher Date: 13 Jan 2003
  • Binding: Digital (delivered electronically)
  • No of Pages: 385
  • Series Title: Discrete Mathematics and Its Applications


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)
Taylor & Francis Ltd -
Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Fundamentals of Information Theory and Coding Design: (Discrete Mathematics and Its Applications)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    Your IP: 216.73.216.66 IN