One way of detecting errors is to transmit data as a block of n rows of k bits per row and adding parity bits to each row and each column. The lower-right corner is a parity bit that checks its row and its column, Will this scheme detect all single errors? Double errors? Triple errors?

If we use the 128-bit binary field extension F 128 to decode the 127-bit binary BCH code at a distance of 6, we get a total of 127 bits. How big is the code, and is there a guaranteed minimum separation?

Consider the example below that shows both the payload and the two- dimensional parity bits (shown in green), and where exactly one of the payload or parity bits shown has been corrupted. In this example, odd parity is used. - 11000100 001111000 01010010010101101 00110111 100011001 11110110011011111 10111011 110011100 00010011 100110000 Please indicate the row and the column location of the bit that has flipped from its original value.

- In a codeword, we add two redundant bits to each 8-bit data word. Find the following: Number of valid codewords , Number of invalid codewords.  - If we want to be able to detect 2-bit errors, what should be the minimum Hamming distance? - In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor?

The following is a string of ASCII characters whose bit patterns have been converted intohexadecimal for compactness: 73 F4 E5 76 E5 4A EF 62 73. Of the eight bits in each pairof digits, the leftmost is a parity bit. The remaining bits are the ASCII code.(a) Convert the string to bit form and decode the ASCII.(b) Determine the parity used: odd or even?

Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits А 000 2 E 001 H 010 1 K 011 1 М 100 3 101 1 R 110 2 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: "MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.

B={1,2,3,4,5,6,7,8,9,10} Using the n-bit binaries to which subset in the power set of the ordered set B does the following bit string represent: 1100000011

The erroneous data and control bits were received as 1110101 with a 1 bit error. This format uses D4 D3 D2 C3 D1 C2 C1 where Ds are data bits and Cs are control bits. Find the original error free 4 bit data by VENN diagram. (help: place the bits as shown in the figure. Numbers are bit positions starting from the right). You have to show your solution steps.

Consider a binary code that consists of only four valid code wards as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q are

Suppose we truncate a 4-bit value (represented by hex digits 0 through F) to a 3- bit value (represented as hex digits 0 through 7.) Fill in the table below showing the effect of this truncation for some cases, in terms of the unsigned and two's complement interpretations of those bit patterns. Two's Complement Original 1 3 Нех Unsigned Original 1 Original 1 Truncated Truncated Truncated 1 3 2 3 5 3 5 C 4 12 -4 E 14 -2