Check Digits: the Doubling Rule (Mod 10), Weighted Mod 11 and Catching Swapped Digits
This lesson is part of the course
In this lesson
You compute check digits for fictional sensor IDs with a doubling rule and with weighted mod 11, then show that the weighted scheme catches two swapped digits.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Bits & Errors: Bit Strings, Flipped Bits, Bursts and Expected Error Counts Locked
- Parity Bits: Even and Odd Parity, What One Parity Bit Misses and 2-D Parity Grids Locked
- Check Digits: the Doubling Rule (Mod 10), Weighted Mod 11 and Catching Swapped Digits Locked
- Checksums: Byte Sums mod 256, Check Bytes, Ones'-Complement Folding and Their Blind Spots Locked
- XOR without XOR: MOD(a+b,2) Bit by Bit, Masks, Undoing XOR and Hamming Distance Locked
- CRC by Long Division: Generator Bits, MOD-2 Rows, the Remainder and Checking a Received Frame Locked
- Hamming(7,4): Parity Positions, Encoding Four Data Bits, the Syndrome and Correcting a Flipped Bit Locked
- Overhead vs Protection: Code Rates, Detection and Correction Power, and a Comparison Chart Locked