Hamming Distance:

The hamming distance between two bit patterns is the number of bits in which the patterns differ.

There are many codes possible for this scheme.

Start with A with five bits pattern length 00000.

The Hamming distance between the patterns representing A and B in the code in Table 1 is four.

The Hamming distance between B and C in the code in Table 1 is three.

The Hamming distance between A and D in the code in Table 1 is three.

The Hamming distance between B and D in the code in Table 1 is three.

The important feature of the code in Table 1 is that any two patterns are separated by a Hamming distance of at least three

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 1.10, Problem 5QE

Chapter 1, Problem 1CRP

Students have asked these similar questions

A barcode scanner for Universal Product Codes (UPCs) verifies the 12-digit code scanned by comparing the code's largest digit (called a check digit) to its own computation of the check digit from the first 11 digits as follows: 1. Calculate the sum of the digits in the odd-numbered positions (the first, third,..... eleventh digits) and multiply this sum by 3. 2. Calculate the sum of the digits in the even-numbered position (the second, fourth....tenth digits) and add this to the previous result. 3. If the last digit of the result from step 2 is 0, then 0 is the check digit. Otherwise, subtract the last digit from 10 to calculate the check digit. 4. If the check digit matches the final digit of the 12-digit UPC, the UPC is assumed correct By using C++ write a program that prompts the user to enter the 12 digits of a barcode separated by space. The program should store the digits in an integer array, calculate the check digit, and compare it to the final barcode digit. If the digits…

Suppose that we use the floating-point format with 12 decimal digits, SEEEMMMMMMMM, to rep- resent a real number, where S is the digit to represent the sign of the mantissa (use 0 for pos- itive and 5 for negative), EEE are the 3 digits to represent the exponent in excess-500 format, MMMMMMMM are the 8 digits to represent the magnitude of the mantissa, and the decimal point of the mantissa is right to the left of MMMMMMMM (i.e., SEEEMMMMMMMM representing the real number +0.MMMMMMMM × 10EEE-500) What are the smallest positive number and the largest positive number that can be represented in this format? Write them in exponential notation.

Suppose that we use the floating-point format with 12 decimal digits, SEEEMMMMMMMM, to rep- resent a real number, where S is the digit to represent the sign of the mantissa (use 0 for pos- itive and 5 for negative), EEE are the 3 digits to represent the exponent in excess-500 format, MMMMMMMM are the 8 digits to represent the magnitude of the mantissa, and the decimal point of the mantissa is right to the left of MMMMMMMM (i.e., SEEEMMMMMMMM representing the real number +0.MMMMMMMM × 10EEE-500.) When you use this format to represent a real number, in which scenario an overflow will occur and in which scenarios an underflow may occur?

Chapter 1 Solutions

Computer Science: An Overview (13th Edition) (What's New in Computer Science)

Ch. 1.1 - What input bit patterns will cause the following...Ch. 1.1 - In the text, we claimed that placing a 1 on the...Ch. 1.1 - Assuming that both inputs to the flip-flop in...Ch. 1.1 - a. If the output of an AND gate is passed through...Ch. 1.1 - Prob. 5QE Ch. 1.1 - Prob. 6QE Ch. 1.2 - If the memory cell whose address is 5 contains the...Ch. 1.2 - Prob. 2QE Ch. 1.2 - Design a sequence of steps that correctly...Ch. 1.2 - How many bits would be in the memory of a computer...

Ch. 1.3 - Prob. 1QE Ch. 1.3 - Prob. 2QE Ch. 1.3 - Prob. 3QE Ch. 1.3 - Prob. 4QE Ch. 1.3 - Prob. 5QE Ch. 1.3 - Prob. 6QE Ch. 1.4 - Here is a message encoded in ASCII using 8 bits...Ch. 1.4 - In the ASCII code, what is the relationship...Ch. 1.4 - Prob. 3QE Ch. 1.4 - Prob. 4QE Ch. 1.4 - Convert each of the following binary...Ch. 1.4 - Prob. 6QE Ch. 1.4 - What is the largest numeric value that could be...Ch. 1.4 - An alternative to hexadecimal notation for...Ch. 1.4 - What is an advantage of representing images via...Ch. 1.4 - Prob. 10QE Ch. 1.5 - Convert each of the following binary...Ch. 1.5 - Convert each of the following base ten...Ch. 1.5 - Convert each of the following binary...Ch. 1.5 - Express the following values in binary notation:...Ch. 1.5 - Perform the following additions in binary...Ch. 1.6 - Convert each of the following twos complement...Ch. 1.6 - Prob. 2QE Ch. 1.6 - Suppose the following bit patterns represent...Ch. 1.6 - Suppose a machine stores numbers in twos...Ch. 1.6 - In the following problems, each bit pattern...Ch. 1.6 - Prob. 6QE Ch. 1.6 - Prob. 7QE Ch. 1.6 - Prob. 8QE Ch. 1.6 - Prob. 9QE Ch. 1.6 - Prob. 10QE Ch. 1.6 - Prob. 11QE Ch. 1.7 - Prob. 1QE Ch. 1.7 - Prob. 3QE Ch. 1.7 - Prob. 4QE Ch. 1.8 - What makes Python an interpreted programming...Ch. 1.8 - Write Python statements that print the following:...Ch. 1.8 - Write Python statements to make the following...Ch. 1.8 - Write a Python statement that given an existing...Ch. 1.9 - Prob. 1QE Ch. 1.9 - Prob. 2QE Ch. 1.9 - Prob. 3QE Ch. 1.9 - Prob. 4QE Ch. 1.9 - Prob. 5QE Ch. 1.9 - Prob. 6QE Ch. 1.9 - Prob. 7QE Ch. 1.10 - Prob. 1QE Ch. 1.10 - Could errors have occurred in a byte from Question...Ch. 1.10 - Prob. 3QE Ch. 1.10 - Prob. 4QE Ch. 1.10 - Prob. 5QE Ch. 1.10 - Prob. 6QE Ch. 1 - Determine the output of each of the following...Ch. 1 - a. What Boolean operation does the circuit...Ch. 1 - a. If we were to purchase a flip-flop circuit from...Ch. 1 - Assume that both of the inputs in the following...Ch. 1 - The following table represents the addresses and...Ch. 1 - How many cells can be in a computers main memory...Ch. 1 - Prob. 7CRP Ch. 1 - Prob. 8CRP Ch. 1 - Prob. 9CRP Ch. 1 - Prob. 10CRP Ch. 1 - Suppose a picture is represented on a display...Ch. 1 - Prob. 12CRP Ch. 1 - Prob. 13CRP Ch. 1 - If each sector on a magnetic disk contains 1024...Ch. 1 - How many bytes of storage space would be required...Ch. 1 - Prob. 16CRP Ch. 1 - Prob. 17CRP Ch. 1 - Suppose a typist could type 60 words per minute...Ch. 1 - Prob. 19CRP Ch. 1 - Prob. 20CRP Ch. 1 - Prob. 21CRP Ch. 1 - Prob. 22CRP Ch. 1 - Prob. 23CRP Ch. 1 - Prob. 24CRP Ch. 1 - Prob. 25CRP Ch. 1 - Prob. 26CRP Ch. 1 - Prob. 27CRP Ch. 1 - Prob. 28CRP Ch. 1 - Prob. 29CRP Ch. 1 - Prob. 30CRP Ch. 1 - Prob. 31CRP Ch. 1 - Prob. 32CRP Ch. 1 - Prob. 33CRP Ch. 1 - Prob. 34CRP Ch. 1 - Prob. 35CRP Ch. 1 - Prob. 36CRP Ch. 1 - Prob. 37CRP Ch. 1 - Prob. 38CRP Ch. 1 - Prob. 39CRP Ch. 1 - Prob. 40CRP Ch. 1 - Prob. 41CRP Ch. 1 - Prob. 42CRP Ch. 1 - Prob. 43CRP Ch. 1 - Prob. 44CRP Ch. 1 - Prob. 45CRP Ch. 1 - What would be the hexadecimal representation of...Ch. 1 - Prob. 47CRP Ch. 1 - Prob. 48CRP Ch. 1 - Prob. 49CRP Ch. 1 - Prob. 50CRP Ch. 1 - Prob. 51CRP Ch. 1 - Prob. 52CRP Ch. 1 - Prob. 53CRP Ch. 1 - Prob. 54CRP Ch. 1 - Prob. 55CRP Ch. 1 - Prob. 56CRP Ch. 1 - Prob. 57CRP Ch. 1 - Prob. 58CRP Ch. 1 - Write and test a Python script that, given a...Ch. 1 - Prob. 61CRP Ch. 1 - Prob. 2SI Ch. 1 - Prob. 3SI Ch. 1 - Prob. 4SI Ch. 1 - Prob. 5SI Ch. 1 - Prob. 6SI Ch. 1 - Prob. 7SI

Knowledge Booster

Solution Summary: The author explains that the hamming distance between two bit patterns is the number of bits in which the patterns differ.

Explanation of Solution

Want to see the full answer?

Chapter 1 Solutions