Hamming Codes with error detection and Correction Part-1
Duration: 12 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces Hamming codes as single-bit error-correcting block codes with minimum distance dmin = 3, enabling detection of up to two errors or correction of one error. The instructor defines the relationship between total codeword length n, data bits k, and redundancy r using n = 2^r - 1 and k = n - r or k = 2^r - r - 1. A table maps bit positions 1 through 20 to parity bits at powers of two (p1, p2, p4, p8, p16) and data bits elsewhere, with X marks showing which positions each parity bit covers. The lecture then works the standard example r = 3, giving n = 7 and k = 4, i.e., the Hamming code C(7,4) with dmin = 3. Parity bits are placed at positions 1, 2, and 4; data bits occupy positions 3, 5, 6, and 7. Using even parity, the instructor specifies coverage sets: P1 checks positions 1, 3, 5, 7; P2 checks 2, 3, 6, 7; and P4 checks 4, 5, 6, 7. Handwritten binary sequences illustrate how each parity bit is computed from the covered positions.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with the slide titled “Hamming Codes,” stating that these codes are designed with dmin = 3, meaning they can detect up to two errors or correct one single error. The instructor emphasizes that the discussion focuses on the single-bit error-correcting code, a phrase underlined on screen. The formulas n = 2^r - 1 and k = n - r or k = 2^r - r - 1 are displayed, establishing the relationship among total bits n, data bits k, and redundancy r. A table begins mapping bit positions 1 through 20 to encoded data bits, with parity bits p1, p2, p4, p8, and p16 highlighted in green under “Parity bit coverage.”
2:00 – 5:00 02:00-05:00
The instructor continues explaining the Hamming code structure, pointing to the slide with a pen and then gesturing while speaking. The same “Hamming Codes” slide remains visible, with the dmin = 3 bullet and the underlined focus on single-bit error correction. A hand-drawn diagram appears above the table showing two arrow segments labeled K and r, alongside a boxed formula reading k = 2^r - r - 1. The grid table maps bit positions 1 through 20 to alternating p and d labels, with X marks filling cells to show coverage by each parity bit. The instructor raises a pen to write on the board, beginning worked calculations.
5:00 – 10:00 05:00-10:00
The lecture transitions to a concrete example. A new slide states, “For example, if r = 3, then n = 7 and k = 4. This is a Hamming code C(7, 4) with dmin = 3.” Handwritten annotations include k = 4 and a worked line y = 8 − 3 − 1, illustrating the formula application. The instructor explains that parity bits are placed at positions that are powers of two: 2^0 = 1, 2^1 = 2, and 2^2 = 4. A table maps positions 1 through 7 to P1, P2, D1, P4, D2, D3, and D4. Even-parity checks are listed: “For parity bit P1 we check position 1, 3, 5, 7,” “For parity bit P2 we check position 2, 3, 6, 7,” and “For parity bit P4 we check position 4, 5, 6, 7.” The instructor writes binary sequences on the right side of the screen and draws arrows from table positions to these sequences, demonstrating how each parity bit is calculated.
10:00 – 11:58 10:00-11:58
The final segment reinforces the C(7,4) construction. The instructor displays the Hamming code parameters with n = 7 and k = 4, dmin = 3. The positions for parity bits are reiterated as powers of 2: 1, 2, and 4. The coverage sets for each parity bit are restated: P1 checks positions 1, 3, 5, and 7; P2 checks 2, 3, 6, and 7; P4 checks 4, 5, 6, and 7. A 7-bit table is drawn with data bits D1 through D4 and parity bits P1, P2, and P4. The instructor annotates the board with binary values and parity calculations, using a pointer to highlight specific positions in the table. The even-parity calculation process is illustrated with handwritten binary values, showing how the parity bits are determined from the covered data positions.
The lecture progresses systematically from general principles to a specific worked example. It begins by defining Hamming codes as error-correcting codes with dmin = 3, which provides the capability to detect two errors or correct one. The mathematical foundation is established through the formulas n = 2^r - 1 and k = 2^r - r - 1, linking the number of redundancy bits r to the total codeword length n and data bits k. A visual table maps bit positions to parity and data bits, with X marks illustrating the coverage pattern: each parity bit at position 2^i checks a specific subset of positions. The lecture then applies these principles to the canonical C(7,4) code with r = 3. Parity bits are placed at positions 1, 2, and 4 (powers of two), while data bits occupy the remaining positions. The instructor explicitly lists the coverage sets for each parity bit and demonstrates even-parity calculation using handwritten binary sequences. This structured approach—definition, formula, visual mapping, and worked example—provides a clear framework for understanding Hamming code construction.

