Please solve both question asap. 5. In the table below, the sender sends dataword 10. A 3-bit burst error corrupts thecodeword. Can the receiver detect the error? Defend your answer.DatawordCodeword000000001010111010101111106. Find the minimum Hamming distance for the following cases:a. Detection of two errors.b. Correction of two errors.c. Detection of 3 errors or correction of 2 errors.d. Detection of 6 errors or correction of 2 crrors.

Answered: Image /qna-images/answer/cb35c4fe-f25b-4ac2-a4b9-33c1c0270ac5.jpg

Answered: 5. In the table below, the sender sends…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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?
1-A system has received 2 bytes of transmission, with the first bit being an extra odd parity bit: 100001111, 001010101. Is there detectable error? 2- A digital recording of audio file is 120 seconds, with bitrate 44 Kbps. Write down the exact number of KB needed for this recording. 3-Write down the smallest number in decimal, that can be represented by 11bit signed binary
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV.
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
The very last block of a message encrypted with AES-256 in CBC mode is 15 bytes long and ends with the bytes: 0102030405060708090a0b0c0d0e0f When padded in accordance with PKCS #7 with 16-byte blocks, what is the complete value of the last block? *Please explain how you have solved this, thank you!!
Assume you are using any correct plaintext padding method, such as those described in lecture, with a 128-bit (16-byte) block cipher. If you are sending a message that is 184 bytes long, how many padding bytes would you need to add? Justify your answer. For the remaining questions, consider a 4-bit block cipher, described in hexadecimal by the following table: Plaintext Ciphertext Plaintext Ciphertext 0 a 8 e 1 c 9 d 2 f a 0 3 6 b 7 4 3 c 5 5 8 d b 6 4 e 9 7 2 f 1 You can think of this as a simple substitution cipher for hexadecimal digits. There is no “key” other than the table itself.
If an error happened in the following scenario, please mention whether it occurred. The sender sends the number “001011010” to the recipient. The devices make use of odd parity, 8-bit data, and a 1-bit (LSB) parity for each bit of information. What happens if the devices are utilizing even parity instead than odd? What are the communication protocols that are utilized in TESLA automobiles? Insert the schematic of the one(s) that you have discovered.
Computer Network : Suppose 3 blocks of 16 bits need to be sent, using Checksum method proves the following cases: When there is no error When there is a burst error and detected. When there is a burst error and remains undetected Block 1: 1011101110101011 Block 2: 0101000011111010 Block 3: 0111010110101010
Given the two binary numbers 11111100 and 01110000:1. a) Which of these two numbers is the larger unsigned binarynumber?2. b) Which of these two is the larger when it is beinginterpreted on a computer using signed two’s complementrepresentation?3. c) Which of these two is the smaller when it is beinginterpreted on a computer using signed-magnituderepresentation?
greatestBitPos(x) Compute a mask marking the most significant 1 bit. program should return maskmarking not value of significant bit example: greatestBitPos(96) = 0x40 /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…
b. How many bytes are retransmitted finally? Is the answer 20 ?

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

5. In the table below, the sender sends dataword 10. A 3-bit burst crror corrupts the codeword. Can the receiver detect the error? Defend your answer. Dataword Codeword 00 00000 01 01011 10 10101 11110 6. Find the minimum Hamming distance for the following cases: