Idea of Block Coding for Error Detection

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/computer-network/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 Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access 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, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…