Idea of Block Coding for Error Detection

Duration: 11 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/basics-hamming-dist/asset-idea-of-block-coding-for-error-detection 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
  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
  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 block coding as a method for error detection in data transmission. The instructor defines the fundamental structure where messages are divided into k-bit blocks called datawords. To these datawords, r redundant bits are added to form n-bit codewords, establishing the relationship n = k + r. The core concept is that while there are 2^n possible combinations of n bits, only 2^k of these are valid codewords corresponding to the original datawords. The remaining 2^n - 2^k combinations are unused and serve as a mechanism to detect errors. The lecture progresses from defining these terms to illustrating specific mappings, such as mapping 2-bit datawords to 3-bit or 5-bit codewords. Visual aids include diagrams showing the expansion from k bits to n bits, tables mapping specific inputs like "00" to outputs like "000", and calculations of unused codewords. The instructor emphasizes that the block coding process is one-to-one, ensuring each dataword maps to a unique codeword.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture begins with the definition of block coding. The instructor explains that messages are divided into blocks of k bits, termed datawords. A diagram illustrates the addition of r redundant bits to these datawords to create n-bit codewords. The formula n = k + r is explicitly written on the digital whiteboard to define the relationship between dataword length, redundant bits, and codeword length. The slide text states "In block coding, we divide our message into blocks, each of k bits, called datawords." The visual distinction is made between the 2^k valid datawords and the larger set of 2^n possible n-bit combinations, noting that only a subset are valid codewords.

  2. 2:00 – 5:00 02:00-05:00

    The instructor elaborates on the mapping process between datawords and codewords. Visual aids show blue boxes labeled "k bits" representing the 2^k datawords and yellow boxes labeled "n bits" for the codewords. The instructor draws arrows to demonstrate a one-to-one mapping where each dataword corresponds to exactly one codeword. Specific examples are introduced, such as k=2 and n=3, where 4 datawords map to 8 possible codewords. The slide text highlights "k=2, n=3" and lists mappings like "00 -> 000", "01 -> 011", "10 -> 101", and "11 -> 110". The concept of unused codewords is introduced, explaining that since n > k, there are more possible codewords than datawords.

  3. 5:00 – 10:00 05:00-10:00

    The lecture focuses on the implications of unused codewords for error detection. The instructor explains that because n > k, there are 2^n - 2^k unused codewords. A second example is shown with k=2 and n=5, illustrating a larger gap between datawords and codewords. The instructor calculates the number of unused combinations, noting "32-4 = 28" for a specific case. The slide text reinforces that "Since n > k, the number of possible codewords is larger than the number of possible datawords." The instructor uses handwritten annotations to highlight the mapping process and calculate total combinations using powers of 2. This section emphasizes that if a received codeword is not in the valid set, an error has occurred.

  4. 10:00 – 10:35 10:00-10:35

    The lecture concludes by summarizing the block coding process. The instructor reiterates that the mapping is one-to-one and that unused codewords are essential for error detection. The slide displays the relationship "2^k datawords" versus "2^n codewords". The visual examples for k=2 and n=3 are revisited to reinforce the concept that valid codewords are a subset of all possible n-bit strings. The final text on screen states "block coding process is one-to-one" and shows the calculation of unused codewords. The instructor ensures students understand that error detection relies on identifying received bits that do not match any valid codeword in the predefined mapping table.

The lecture systematically builds the concept of block coding for error detection. It starts with the basic definition: dividing messages into k-bit datawords and adding r redundant bits to form n-bit codewords (n = k + r). The instructor uses visual diagrams and tables to show the one-to-one mapping between datawords and codewords. Key examples include k=2, n=3 and k=2, n=5, which illustrate how the number of possible codewords (2^n) exceeds the number of datawords (2^k). The unused combinations (2^n - 2^k) are highlighted as the mechanism for error detection. The instructor emphasizes that any received codeword not in the valid set indicates an error. This progression from definition to mapping to error detection logic provides a clear foundation for understanding block coding.

Loading lesson…