Basics of One-Dimesional Parity Check
Duration: 6 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 the Simple Parity-Check Code, a fundamental error-detecting method in digital communications. The instructor defines the code as a technique where a k-bit dataword is transformed into an n-bit codeword by adding exactly one parity bit, resulting in the relationship n = k + 1. The primary function of this extra bit is to ensure that the total count of 1s in the resulting codeword remains even, although the lecture notes that odd implementations are theoretically possible. The lesson progresses from defining these parameters to illustrating specific binary examples, such as a 7-bit dataword becoming an 8-bit codeword. The instructor emphasizes that this method can detect any odd number of errors due to its minimum Hamming distance (dmin) being 2. The visual progression includes handwritten binary sequences on a whiteboard and block diagrams showing the sender-receiver architecture, where a generator adds the parity bit at the source and a checker verifies it at the destination.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins with the instructor standing before a slide titled "Simple Parity-Check Code." The on-screen text defines the core mechanism: a k-bit dataword is converted into an n-bit codeword where n = k + 1. The instructor explains that the extra bit, known as the parity bit, is selected specifically to make the total number of 1s in the codeword even. Visual evidence includes the instructor wearing a black polo shirt with a red collar and glasses, standing next to slides that explicitly state "Perhaps the most familiar error-detecting code is the simple parity-check code." The segment establishes the foundational rule that n equals k plus one, setting the stage for practical examples.
2:00 – 5:00 02:00-05:00
The instructor transitions to practical application by writing binary sequences on the whiteboard. He demonstrates the calculation n = k + 1 using a specific example where k equals 7, resulting in an n value of 8. The visual progression shows the instructor appending a parity bit to the end of the dataword to ensure an even count of 1s. Key visible events include the instructor circling and annotating the formula n = k + 1, writing out binary sequences like `1 0 1 0`, and calculating the total bits. The segment also introduces a diagram showing the sender encoder and receiver decoder process, illustrating how datawords are encoded with parity bits before transmission.
5:00 – 5:47 05:00-05:47
The final segment focuses on the theoretical properties and system architecture of the code. The instructor writes dmin = 1 + 1 = 2 on the whiteboard to demonstrate that the minimum Hamming distance for this code is 2. This property allows the system to detect an odd number of errors. The lesson concludes with a transition to a block diagram illustrating the sender and receiver components, including labels for "Generator," "Checker," and "Decision logic." The visual evidence shows the flow of data from a Dataword to a Codeword at the Sender, and back through the Receiver for verification. The instructor connects these theoretical formulas to practical block diagrams to complete the explanation of error detection.
The lecture systematically builds an understanding of Simple Parity-Check Code by first defining its mathematical structure, then demonstrating its application through binary examples, and finally analyzing its error-detection capabilities. The core formula n = k + 1 is consistently reinforced across all segments, serving as the anchor for understanding how datawords expand into codewords. The instructor uses a combination of slide text and whiteboard writing to clarify that the parity bit ensures an even number of 1s, which is critical for error detection. The minimum Hamming distance (dmin) of 2 is derived directly from the single parity bit added, establishing that this code can detect any odd number of errors but cannot correct them. The inclusion of sender-receiver block diagrams provides a practical context for how the theoretical concepts are implemented in communication systems, showing the Generator adding bits at the source and the Checker verifying them at the destination.

