Useful Links
Computer Science
Computer Science Fundamentals
Information Theory
1. Foundational Concepts of Information
2. Entropy and Information Measures
3. Source Coding and Lossless Compression
4. Channel Capacity and Noisy Communication
5. Error Control Coding
6. Rate-Distortion Theory
7. Information Theory in Continuous Settings
8. Network Information Theory
9. Advanced Topics and Applications
Error Control Coding
Fundamentals of Error Control
Error Models
Random Errors
Burst Errors
Erasure Errors
Code Parameters
Block Length
Information Length
Code Rate
Minimum Distance
Error Detection and Correction Capabilities
Hamming Distance
Sphere-Packing Bound
Singleton Bound
Plotkin Bound
Linear Block Codes
Vector Space Structure
Generator Matrix
Parity-Check Matrix
Dual Codes
Encoding and Decoding
Systematic Encoding
Syndrome Decoding
Standard Array Decoding
Maximum Likelihood Decoding
Code Families
Hamming Codes
Extended Hamming Codes
Simplex Codes
First-Order Reed-Muller Codes
Cyclic Codes
Polynomial Representation
Generator Polynomials
Check Polynomials
Roots and Minimal Polynomials
BCH Codes
Construction Method
Error Correction Capability
Decoding Algorithms
Reed-Solomon Codes
Construction over Finite Fields
Maximum Distance Separable Property
Applications in Storage and Communication
Convolutional Codes
Encoder Structure
Shift Register Implementation
Generator Polynomials
State Diagrams
Trellis Representation
State Transitions
Path Enumeration
Distance Properties
Decoding Algorithms
Viterbi Algorithm
BCJR Algorithm
Sequential Decoding
Modern Coding Techniques
Turbo Codes
Parallel Concatenated Structure
Iterative Decoding
Performance Near Shannon Limit
Low-Density Parity-Check Codes
Sparse Matrix Structure
Belief Propagation Decoding
Density Evolution Analysis
Polar Codes
Channel Polarization Phenomenon
Successive Cancellation Decoding
Achieving Channel Capacity
Previous
4. Channel Capacity and Noisy Communication
Go to top
Next
6. Rate-Distortion Theory