Basics of One-Dimesional Parity Check

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/networking/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. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full 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…