Two-Dimesional Parity Check

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…