Chapter 4 / 4.18 / 4.18.7

4.18.7 What Are Block Codes And Hamming Codes?

Learn how block codes divide information into fixed-length blocks and add parity bits to create error-protected codewords. Explore Hamming codes, one of the first practical error-correcting codes and the foundation of modern coding theory.

1. What Is a Block Code?
2. Why Are They Called Block Codes?
3. What Do the Terms (n,k) Mean?
4. What Is Code Rate?
5. Why Is Redundancy Needed?
6. What Is a Codeword?
7. What Makes One Block Code Better Than Another?
8. What Is a Linear Block Code?
9. What Is a Generator Matrix?
10. What Is a Parity-Check Matrix?
11. Who Was Richard Hamming?
12. What Is a Hamming Code?
13. Why Is the (7,4) Hamming Code So Important?
14. How Are Hamming Codes Constructed?
15. What Is Syndrome Decoding?
16. How Does a Hamming Code Correct Errors?
17. How Many Errors Can a Hamming Code Correct?
18. What Is an Extended Hamming Code?
19. Where Are Hamming Codes Used?
20. What Are the Advantages of Block Codes?
21. What Are the Limitations of Hamming Codes?
22. How Do Block Codes Influence Modern Coding Systems?
23. Why Are Block Codes and Hamming Codes Important?

Read full FAQ