Basics of Hamming Distance

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-1-computer-networks/dll-error-control/basics-hamming-dist/asset-basics-of-hamming-distance after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, Multi-Topic Content (Cross-Concept Material), हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, हिन्दी की रूप रचना, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: 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, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking, कंप्यूटर की मूल बातें और हार्डवेयर / Computer Fundamentals and Hardware, प्रत्यक्ष बोध / Literal Comprehension, कंप्यूटर सॉफ्टवेयर / Computer Software, निष्कर्षात्मक बोध / Inferential Comprehension, आलोचनात्मक बोध / Critical Comprehension, इंटरनेट और वर्ल्ड वाइड वेब / Internet and World Wide Web, ई-मेल और ऑनलाइन संचार / Email and Online Communication, साइबर सुरक्षा / Cyber Security, अपशिष्ट प्रबंधन / Waste Management, डिजिटल नैतिकता, बौद्धिक संपदा और समाज / Digital Ethics, IPR and Society, डिजिटल एवं नव माध्यम / Digital and New Media, क्लाउड और वितरित कंप्यूटिंग / Cloud and Distributed Computing, शोध नैतिकता / Research Ethics, उभरती प्रौद्योगिकियाँ / Emerging Technologies, शिक्षा और शासन में ICT / ICT in Education and Governance
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | 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, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and Probability, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Hamming distance as a fundamental metric in coding theory, defining it as the number of differences between corresponding bits in two words of equal size. The instructor demonstrates calculation methods using XOR operations and bitwise comparison, then extends the concept to Minimum Hamming Distance within a set of codewords. Finally, the lesson establishes three critical parameters for coding schemes: codeword size n, dataword size k, and minimum Hamming distance dmin.

Chapters

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

    The video opens with a definition of Hamming distance, denoted as d(x, y), representing the count of differing bits between two words. The instructor explains that applying an XOR operation on two binary words and counting the resulting 1s provides a quick calculation method. On-screen text explicitly states: 'The Hamming distance between two words (of the same size) is the number of differences between the corresponding bits.' A worked example demonstrates d(000, 011) equals 2 because the XOR result is 011, containing two 1s. The segment concludes by introducing a practice problem: 'The Hamming distance d(10101, 11110) is ________ ?' requiring students to apply the XOR method.

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

    The lecture transitions to Minimum Hamming Distance, defined as the smallest distance between any pair of codewords in a set. The instructor presents four binary codewords labeled C1 through C4 and systematically calculates pairwise distances to identify the minimum. Visible calculations include d(00000, 01011) = 3 and d(01011, 11110) = 3. The instructor writes these values on a whiteboard next to the slide content, showing d(01011, 10101) = 4 and d(00000, 11110) = 4. After evaluating all combinations, the instructor concludes that d_min equals 3, emphasizing that this value determines error detection and correction capabilities.

  3. 5:00 – 7:46 05:00-07:46

    The final section establishes three essential parameters for any coding scheme: codeword size n, dataword size k, and minimum Hamming distance dmin. The notation C(n, k) is introduced to describe these schemes. Two specific examples are displayed in tables mapping datawords to codewords: C(3, 2) with dmin=2 and C(5, 2) with dmin=3. The instructor points to specific rows in the dataword table and circles parameters n and k in formulas, highlighting how input datawords transform into output codewords. The slide text explicitly lists 'Three Parameters' and shows the relationship between input size, output size, and error resilience.

The lecture progresses logically from basic distance calculation to system-level parameters. First, Hamming distance is defined as a bit-counting metric solvable via XOR operations. Second, Minimum Hamming Distance is derived by comparing all codeword pairs in a set to find the smallest value. Third, these concepts are unified under three coding parameters: n (codeword size), k (dataword size), and dmin. The examples C(3, 2) with dmin=2 and C(5, 2) with dmin=3 illustrate how different configurations affect error handling. The visual evidence shows consistent use of binary strings, XOR logic, and tabular mappings to reinforce these relationships.

Loading lesson…