信息论、编码与密码学（英文版）
目 录内容简介
Preface
Acknowledgements
Part I
Information Theory and Source Coding
1. Source Coding
1.1 Introduction to Information Theory
1.2 Uncertainty And Information
1.3 Average Mutual Information And Entropy
1.4 Information Measures For Continuous Random Variables
1.5 Source Coding Theorem
1.6 HuffmanCoding
1.7 The Lempel-Ziv Algorithm
1.8 Run Length Encoding and the PCX Format
1.9 Rate Distortion Function
1.10 Optimum Quantizer Design
1.11 Introduction to Image Compression
1.19 TheJpeg Standard for Lossless Compression
1.13 TheJpeg Standard for Lossy Compression
1.14 Concluding Remarks
Summary
Problems
Computer Problems
2. Channel Capacity and Coding
2.1 Introduction
2.2 Channel Models
2.3 Channel Capacity
2.4 Channel Coding
2.5 Information Capacity Theorem
2.6 The Shannon Limit
2.7 Random Selection of Codes
2.8 Concluding Remarks
Summary
Problems
Computer Problems
Part II
Error Control Coding
(Channel Coding)
3. Linear Block Codes for Error Correction
3.1 Introduction to Error Correcting Codes
3.2 Basic Definitions
3.3 Matrix Description of Linear Block Codes
3.4 Equivalent Codes
3.5 Parity Check Matrix
3.6 Decoding of a Linear Block Code
3.7 Syndrome Decoding
3.8 Error Probability after Coding (Probability of Error Correction)
3.9 Perfect Codes
3.10 Hamming Codes
3.11 Optimal Linear Codes
3.12 Maximum Distance Separable (MDS) Codes
3.13 Concluding Remarks
Summary
Problems
Computer Problems
4. Cyclic Codes
4.1 Introduction to Cyclic Codes
4.2 Polynomials
4.3 The Division Algorithm for Polynomials
4.4 A Method for Generating Cyclic Codes
4.5 Matrix Description of Cyclic Codes
4.6 Burst Error Correction
4.7 Fire Codes
4.8 Golay Codes
4.9 Cyclic Redundancy Check (CRC) Codes
4.10 Circuit Implementation of Cyclic Codes
4.11 Concluding Remarks
Summary
Problems
Computer Problems
5. Bose-Chaudhuri Hocquenghem (BCH) Codes
5.1 Introduction to BCH Codes
5.2 Primitive Elements
5.3 Minimal Polynomials
5.4 Generator Polynomials in Terms of Minimal Polynomials
5.5 Some Examples of BCH Codes
5.6 Decoding of BCH Codes
5.7 Reed-Solomon Codes
5.8 Implementation of Reed-Solomon Encoders and Decoders
5.9 Nested Codes
5.10 Concluding Remarks
Summary
Problems
Computer Problems
6. Convolutional Codes
6.1 Introduction to Convolutional Codes
6.2 Tree Codes and Trellis Codes
6.3 Polynomial Description of Convolutional Codes
(Analytical Representation)
6.4 Distance Notions for Convolutional Codes
6.5 The Generating Function
6.6 Matrix Description of Convolutional Codes
6.7 Viterbi Decoding of Convolutional Codes
6.8 Distance Bounds for Convolutional Codes
6.9 Performance Bounds
6.10 Known Good Convolutional Codes
6.11 Turbo Codes
6.12 Turbo Decoding
6.13 Concluding Remarks
Summary
Problems
Computer Problems
7. Trellis Coded Modulation
7.1 Introduction to TCM
7.2 The Concept of Coded Modulation
7.3 Mapping by Set Partitioning
7.4 Ungerboecks TCM Design Rules
7.5 Tcm Decoder
7.6 Performance Evaluation for Awgn Channel
7.7 Computation of dfree
7.8 Tcm for Fading Channels
7.9 Concluding Remarks
Summary
Problems
Computer Problems
Part III
Coding for Secure Communications
8. Cryptography
8.1 Introduction to Cryptography
8.2 An Overview of Encryption Techniques
8.3 Operations Used By Encryption Algorithms
8.4 Symmetric (Secret Key) Cryptography
8.5 Data Encryption Standard (DES)
8.6 International Data Encryption Algorithm (IDEA)
8.7 RC Ciphers
8.8 Asymmetric (Public-Key) Algorithms
8.9 The RSA Algorithm
8.10 Pretty Good Privacy (PGP)
8.11 One-Way Hashing
8.12 Other Techniques
8.13 Secure Communication Using Chaos Functions
8.14 Cryptanalysis
8.15 Politics of Cryptography
8.16 Concluding Remarks
Summary
Problems
Computer Problems
Index
Acknowledgements
Part I
Information Theory and Source Coding
1. Source Coding
1.1 Introduction to Information Theory
1.2 Uncertainty And Information
1.3 Average Mutual Information And Entropy
1.4 Information Measures For Continuous Random Variables
1.5 Source Coding Theorem
1.6 HuffmanCoding
1.7 The Lempel-Ziv Algorithm
1.8 Run Length Encoding and the PCX Format
1.9 Rate Distortion Function
1.10 Optimum Quantizer Design
1.11 Introduction to Image Compression
1.19 TheJpeg Standard for Lossless Compression
1.13 TheJpeg Standard for Lossy Compression
1.14 Concluding Remarks
Summary
Problems
Computer Problems
2. Channel Capacity and Coding
2.1 Introduction
2.2 Channel Models
2.3 Channel Capacity
2.4 Channel Coding
2.5 Information Capacity Theorem
2.6 The Shannon Limit
2.7 Random Selection of Codes
2.8 Concluding Remarks
Summary
Problems
Computer Problems
Part II
Error Control Coding
(Channel Coding)
3. Linear Block Codes for Error Correction
3.1 Introduction to Error Correcting Codes
3.2 Basic Definitions
3.3 Matrix Description of Linear Block Codes
3.4 Equivalent Codes
3.5 Parity Check Matrix
3.6 Decoding of a Linear Block Code
3.7 Syndrome Decoding
3.8 Error Probability after Coding (Probability of Error Correction)
3.9 Perfect Codes
3.10 Hamming Codes
3.11 Optimal Linear Codes
3.12 Maximum Distance Separable (MDS) Codes
3.13 Concluding Remarks
Summary
Problems
Computer Problems
4. Cyclic Codes
4.1 Introduction to Cyclic Codes
4.2 Polynomials
4.3 The Division Algorithm for Polynomials
4.4 A Method for Generating Cyclic Codes
4.5 Matrix Description of Cyclic Codes
4.6 Burst Error Correction
4.7 Fire Codes
4.8 Golay Codes
4.9 Cyclic Redundancy Check (CRC) Codes
4.10 Circuit Implementation of Cyclic Codes
4.11 Concluding Remarks
Summary
Problems
Computer Problems
5. Bose-Chaudhuri Hocquenghem (BCH) Codes
5.1 Introduction to BCH Codes
5.2 Primitive Elements
5.3 Minimal Polynomials
5.4 Generator Polynomials in Terms of Minimal Polynomials
5.5 Some Examples of BCH Codes
5.6 Decoding of BCH Codes
5.7 Reed-Solomon Codes
5.8 Implementation of Reed-Solomon Encoders and Decoders
5.9 Nested Codes
5.10 Concluding Remarks
Summary
Problems
Computer Problems
6. Convolutional Codes
6.1 Introduction to Convolutional Codes
6.2 Tree Codes and Trellis Codes
6.3 Polynomial Description of Convolutional Codes
(Analytical Representation)
6.4 Distance Notions for Convolutional Codes
6.5 The Generating Function
6.6 Matrix Description of Convolutional Codes
6.7 Viterbi Decoding of Convolutional Codes
6.8 Distance Bounds for Convolutional Codes
6.9 Performance Bounds
6.10 Known Good Convolutional Codes
6.11 Turbo Codes
6.12 Turbo Decoding
6.13 Concluding Remarks
Summary
Problems
Computer Problems
7. Trellis Coded Modulation
7.1 Introduction to TCM
7.2 The Concept of Coded Modulation
7.3 Mapping by Set Partitioning
7.4 Ungerboecks TCM Design Rules
7.5 Tcm Decoder
7.6 Performance Evaluation for Awgn Channel
7.7 Computation of dfree
7.8 Tcm for Fading Channels
7.9 Concluding Remarks
Summary
Problems
Computer Problems
Part III
Coding for Secure Communications
8. Cryptography
8.1 Introduction to Cryptography
8.2 An Overview of Encryption Techniques
8.3 Operations Used By Encryption Algorithms
8.4 Symmetric (Secret Key) Cryptography
8.5 Data Encryption Standard (DES)
8.6 International Data Encryption Algorithm (IDEA)
8.7 RC Ciphers
8.8 Asymmetric (Public-Key) Algorithms
8.9 The RSA Algorithm
8.10 Pretty Good Privacy (PGP)
8.11 One-Way Hashing
8.12 Other Techniques
8.13 Secure Communication Using Chaos Functions
8.14 Cryptanalysis
8.15 Politics of Cryptography
8.16 Concluding Remarks
Summary
Problems
Computer Problems
Index
目 录内容简介
大多数介绍信息论和编码学的书，不是太过学术化，就是太过简单。本书避免了上述缺点，既考虑到 了数学的严谨性，又充分考虑了易读性。
本书的主要特点 详细介绍了网格编码调制（TCM）．并重点介绍了加性高斯白噪声（AWGN)和衰退倍道。 以大量示例仔细描述了信源编码。 深入讨论了TurboCode。 简要介绍了线性代数。 通过精心挑选的115道例题及115道练习题，清晰透彻地讲解了深奥的理论知识和定义。
通过大量篇幅论述了密码学，包括基本原理。私钥和公钥密码，当今通用的加密标准及最新发展趋势。 “叙述流畅，通过大量示例及精确的解说透彻地论述了各个主题。” ——审稿人 作者简介 RanjanBose子宾夕法尼亚大学获得博士学位，现在是德里印度理工大学的副教授，他曾任加州 圣何塞的联合半导体公司的高级设计工程师。
本书的主要特点 详细介绍了网格编码调制（TCM）．并重点介绍了加性高斯白噪声（AWGN)和衰退倍道。 以大量示例仔细描述了信源编码。 深入讨论了TurboCode。 简要介绍了线性代数。 通过精心挑选的115道例题及115道练习题，清晰透彻地讲解了深奥的理论知识和定义。
通过大量篇幅论述了密码学，包括基本原理。私钥和公钥密码，当今通用的加密标准及最新发展趋势。 “叙述流畅，通过大量示例及精确的解说透彻地论述了各个主题。” ——审稿人 作者简介 RanjanBose子宾夕法尼亚大学获得博士学位，现在是德里印度理工大学的副教授，他曾任加州 圣何塞的联合半导体公司的高级设计工程师。
比价列表
公众号、微信群
缺书网微信公众号
扫码进群实时获取购书优惠