Basics of One-Dimesional Parity Check

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-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. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 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, Transport Layer Services, TL: Congestion & UDP, Application Layer
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…