Two-Dimesional Parity Check

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/dll-error-control/linear-block-codes/asset-two-dimesional-parity-check after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: Introduction to CN, Data Communication, 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the two-dimensional parity check method as an enhanced error-detection technique for data transmission. The instructor organizes binary data into a rectangular grid of rows and columns, calculating parity bits for each row and column to form a complete error-checking table. The method demonstrates the ability to detect up to three errors within the data block, though it may fail when four bits are corrupted simultaneously. The visual progression moves from displaying original 7-bit bytes to showing the calculated row parities appended on the right and column parities at the bottom, creating a syndromic structure for error localization.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video begins by introducing the two-dimensional parity check method, contrasting it with simpler approaches. The instructor displays a slide titled "A better approach is the two-dimensional parity check" alongside original data bytes: 11001110, 10111010, 01110010, and 01010010. The visual organizes these five 7-bit bytes into rows, then calculates row parities (1, 1, 0, 1, 1) and column parities (0 1 0 1 0 1 0). The slide explicitly states that the whole table is sent to the receiver, which finds the syndrome for each row and column. A critical limitation is noted: "However, errors affecting 4 bits may not be detected." The instructor gestures toward the table structure to highlight how data is organized for parity calculation.

  2. 2:00 – 4:38 02:00-04:38

    The lecture transitions to a whiteboard explanation where the instructor writes mathematical formulas on the left side of the board. He draws a grid containing original data, row parities, and column parities to illustrate the error-checking process. Using a marker, he circles specific bits in the second row and draws arrows to demonstrate error detection syndromes. A large circled number "9" appears on the right side of the board in later frames. The instructor gestures toward a diagram showing "Original data" at the top, with labels for "Row Parities" on the right and "Column Parities" at the bottom. Handwritten notes include the formula `d_min = 2E + 1`, and text explains that this method can detect up to three errors but may miss those affecting four bits.

The lecture systematically builds understanding of two-dimensional parity checking by first presenting a tabular method for organizing data and calculating check bits, then reinforcing the concept through whiteboard demonstrations of syndrome detection. The core teaching progression moves from visualizing raw data bytes to constructing a complete parity matrix, emphasizing that row and column parities create a two-dimensional error-checking structure. Key technical takeaways include the ability to detect up to three errors, the specific limitation regarding four-bit error undetection, and the mathematical relationship `d_min = 2E + 1` for minimum distance. The instructor uses both digital slides and handwritten diagrams to show how syndromes are calculated by examining row and column parity mismatches, providing students with both conceptual and procedural knowledge for error detection in data transmission.

Loading lesson…