Basics of One-Dimesional Parity Check

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-networks/dll-error-control/linear-block-codes/asset-basics-of-one-dimesional-parity-check after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
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

  1. 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. 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.

  3. 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.

Loading lesson…