Two-Dimesional Parity Check

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/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. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  7. 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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…