Question

In: Computer Science

2-D bit parity is generated by placing the data bits in a matrix form as shown...

2-D bit parity is generated by placing the data bits in a matrix form as shown below. Then, a parity bit is computed for every row and every column: These parity bits are shown in grey. Assume that even parity is used (as shown below). Assume throughout that the receiver is guaranteed that no more than 2 errors are possible.

1 0 1 0 1 1

1 1 1 1 0 0

0 1 1 1 0 1

0 0 1 0 1 0

(a) Show that any 2-bit errors in data can be detected.

(b) What type of bit errors can go undetected? Explain with an example. (Hint: Think beyond 2 bit errors)

(c) What happens when a parity bit is erroneous? Flip the parity bit corresponding to the third row and explain what will happen.

Solutions

Expert Solution

The given codeword is

1 0 1 0 1 1

1 1 1 1 0 0

0 1 1 1 0 1

0 0 1 0 1 0

Answer:

a) Please find the image below for detailed answer.

b) Bit errors like burst error or errors more than 2 bits error remains undetected.

Please find the image below for detailed answer of b) and c).


Related Solutions

Design a parity bit generator and checker. A system transmits 4 bits of data. Design generator...
Design a parity bit generator and checker. A system transmits 4 bits of data. Design generator and checker in same schematic use XOR gate. DO NOT USE KMAPS. Include truth tables. I am trying to understand the problem. Include boolean expression and explain you work please. Please explain I need to Learn
5. Implement 2-D error detection mechanism using even parity check. Given a data bit to be...
5. Implement 2-D error detection mechanism using even parity check. Given a data bit to be send, perform the even parity check for the data to be send. Append the parity bit at the end of that data. At the receiver end, the receiver has to check for errors in transmission Please code in C language.
Construct an even parity Hamming code with a total of 7 bits (4 data bits and...
Construct an even parity Hamming code with a total of 7 bits (4 data bits and 3 check bits).
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a.6thbit position. b.11thbit position.Assume an odd-parity scheme for this problem.
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a. 6th bit position. b. 11th bit position. Assume an odd-parity scheme for this problem.
A stream of bits, 01111011111011111101111100, needs to be transmitted at the data link layer using bit...
A stream of bits, 01111011111011111101111100, needs to be transmitted at the data link layer using bit stuffing, what is actually transmitted after the bit stuffing? 2) We are transmitting 16-bit data using a Hamming code. What is the minimum number of check bits is needed to ensure that the receiver can correct a single-bit error?
Construct a generator matrix and a parity check matrix for a ternary Hamming code Ham(2, 3)....
Construct a generator matrix and a parity check matrix for a ternary Hamming code Ham(2, 3). Assume a codeword x from for the ternary Hamming code Ham(2, 3)$ was sent and the word y was received. Use the partiy check matrix you constructed in part (a) to decode y in each part using syndrome decoding: (b) y = ( 1 , 1 , 1 , 0 ), (c) y = ( 2 , 2 , 2 , 2 ), (d)...
(2) More inclusion-exclusion counting: How many bit strings of length 15 have bits 1, 2, and...
(2) More inclusion-exclusion counting: How many bit strings of length 15 have bits 1, 2, and 3 equal to 101, or have bits 12, 13, 14, and 15 equal to 1001 or have bits 3, 4, 5, and 6 equal to 1010? (Number bits from left to right. In other words, bit #1 is the left most bit and bit #15 is the right most bit.) Hint: The fact that the third bit appears in two of the required patterns...
Cyclic Redundancy Check Given the data bits D = 110100101011, the generator G = 110011, r...
Cyclic Redundancy Check Given the data bits D = 110100101011, the generator G = 110011, r = 5. 1) Find the CRC. Give the detailed steps of your computation. 2) What does the sender send? 3) Show how the receiver verifies the received data. Assume there is no error. (mostly need help with this step!)
Exercise 2.1.39 Let A be a 2×2 invertible matrix, with A = [a b c d]...
Exercise 2.1.39 Let A be a 2×2 invertible matrix, with A = [a b c d] Find a formula for A−1 in terms of a,b, c,d by using elementary row operations
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT