Ep 051: Introduction to Hamming Code
By adding a set of parity bits to our data, it is possible to correct a single bit error and detect if two bits have changed (i.e., have been inverted). This video presents the most basic of examples for how this works using both Boolean expressions and Venn diagrams.
▶︎
Ep 053: Creating Hamming Code for Eight Data Bits
▶︎
Ep 040: Introduction to Karnaugh Maps
▶︎
AES Explained (Advanced Encryption Standard) - Computerphile
▶︎
Ep 052: Hamming Code and the Error Syndrome
▶︎
But what are Hamming codes? The origin of error correction
▶︎
Professorin berichtet über Morddrohungen an Uni Marburg
▶︎
Ep 055: Introduction to Cyclic Redundancy Checks (CRC)
▶︎
University of Cambridge Maths Admissions Interview
▶︎
Breaking the Enigma Code | The Imitation Game with Benedict Cumberbatch
▶︎
Ep 041: Rules for Makin' Karnaugh Map Rectangles
▶︎
Trump Preps for 80th Birthday, Threatens to Hit Iran, Knicks Historic Win & Elon Musk Trillionaire!?
▶︎
Ep 044: Using Karnaugh Maps to Design a Binary Adder
▶︎
You NEED to STOP Using Windows 11 Right Now
▶︎
Hamming Codes - How Data Corrects Itself
▶︎
Modes of Operation - Computerphile
▶︎
A Scientist's View of War
▶︎
Ep 030: Introduction to Boolean Algebra
▶︎
Hamming Code - How To Find Corrupted Bit - Even Parity
▶︎