Amazon cover image
Image from Amazon.com
Image from Google Jackets

Foundations of coding : theory and applications of error-correcting codes, with an introduction to cryptography and information theory

By: Material type: TextTextLanguage: English Publication details: Chichester Wiley 1991Description: xiii, 336 p. illISBN:
  • 0471621870 (HB)
Subject(s): Online resources:
Contents:
Contents: Part I. Coding and information theory 1. Coding and decoding 2. Huffman codes 3. Data compression and entropy 4. Reliable communications through unreliable channels Part II. Error-correcting codes 5. Binary linear codes 6. Groups and standard arrays 7. Linear algebra 8. Linear codes 9. Reed-Muller codes: Weak codes with easy decoding 10. Cyclic codes 11. Polynomials and finite fields 12. BCH codes: Strong codes correcting multiple errors 13. Fast decoding of BCH codes 14. Convolutional codes Part III. Cryptography 15. Cryptography Appendixes: A. Galois fields B. BCH codes and Reed-Muller codes
Summary: Although devoted to constructions of good codes for error control, secrecy or data compression, the emphasis is on the first direction. Introduces a number of important classes of error--detecting and error--correcting codes as well as their decoding methods. Background material on modern algebra is presented where required.
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 519.711 ADA (Browse shelf(Opens below)) Available 46529

"A Wiley-Interscience publication."
Includes index.

Includes bibliography (p. 327-329) and references

Contents:
Part I. Coding and information theory
1. Coding and decoding
2. Huffman codes
3. Data compression and entropy
4. Reliable communications through unreliable channels
Part II. Error-correcting codes
5. Binary linear codes
6. Groups and standard arrays
7. Linear algebra
8. Linear codes
9. Reed-Muller codes: Weak codes with easy decoding
10. Cyclic codes
11. Polynomials and finite fields
12. BCH codes: Strong codes correcting multiple errors
13. Fast decoding of BCH codes
14. Convolutional codes
Part III. Cryptography
15. Cryptography
Appendixes:
A. Galois fields
B. BCH codes and Reed-Muller codes

Although devoted to constructions of good codes for error control, secrecy or data compression, the emphasis is on the first direction. Introduces a number of important classes of error--detecting and error--correcting codes as well as their decoding methods. Background material on modern algebra is presented where required.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India