QUESTION 2 a) Assume that k = 3 and n = 5. Then the list of datawords and codewoards are given as follows: Dataword Codeword 000 00000 010 01001 011 01100 101 10101 Assume the sender encodes the dataword 010 as 01001 and sends it to the receiver. Explain the following scenario. i. The receiver receives 01001. ii. The receiver receives 01101. 11. The receiver receives 00000. b) Identify the type of error for the following situation. i. A sender sends 01001 and the receiver receives 01101. 11. A sender sends 01001 and the receiver receives 00000.

QUESTION 2 a) Assume that k = 3 and n = 5. Then the list of datawords and codewoards are given as follows: Dataword Codeword 000 00000 010 01001 011 01100 101 10101 Assume the sender encodes the dataword 010 as 01001 and sends it to the receiver. Explain the following scenario. i. The receiver receives 01001. ii. The receiver receives 01101. 11. The receiver receives 00000. b) Identify the type of error for the following situation. i. A sender sends 01001 and the receiver receives 01101. 11. A sender sends 01001 and the receiver receives 00000.

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

Implement the following error detection and error correction algorithms using C programming for Hamming code. For Hamming codes, flip a bit in the data and implement the algorithm to correct the same on the receiver side.
A and B are two unsigned 32 bits numbers. Compare the values of A and B and write if 1. A>B or 2. A
how many 11 - strings (that is, bit strings of length 11) are there which: a. start with sub - string 011 b. have weight 8 (i.e contain exactly 8 1's ) and start with the sub - string 011 c. either start with 011 or end with 01 (or both) d. have weight 8 and either start with 011 or end with 01 (or both)
In this problem, you will design a circuit that encrypts (plaintext to cipher) and decrypts (cipher to plaintext) ASCII characters. The relationship between the plaintext character and cipher character is shown in the table below: plaintext character cipher character 1-? A-O P-Z space t-~ 0 In this table, the "0" and "1" refer to the characters "0" and "1", not the numerical values. Additionally, the circuit only needs to account for character listed in the table. The circuit has nine bits of input: • d = d7... do: an eight-bit number that is the binary representation of the input ASCII character • e: a single bit indicating if the circuit should encrypt (e = 1) or decrypt (e = 0) the given character The circuit has eight bits of output: • r = r7...ro: an eight-bit number that is the binary representation of the output ASCII character Draw the implementation of the circuit. The circuit does not have to be transistor-minimal; you are encouraged to use various combinational circuitry to…
8. We have the following code word: 01111010101. This string has 7 data bits, plus 4check bits. We are using an error-correcting code that can correct single bit errors.In fact, there is a single bit error in this code. Assuming the use of the Hammingalgorithm, locate the bit that has been altered.
The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows: Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393” b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…
P09.
Experiment 1: IMPLEMENTATION OF CAESAR CIPHER Objective: To implement the simple substitution technique named Caesar cipher using C+ language. Theory: To enerypt a message with a Caesar cipher, each letter in the message is changed using a simple rule: shift by three. Each letter of the message is shifted a fixed distance (3 for example) down the alphabet, A becomes D, B becomes E, and so on. For the last letters, we can think of alphabet as a circle and "wrap around", W becomes Z. X becomes A, Y becomes B, and Z becomes C. To change a message back, cach letter is replaced by the one three before it. Example ABCDEFGHIJKLMNOPQRSTUVWXYZ t t t t t t t t ttt t t t t t t tt t t t t t t ft DEFGHIJKLMNOPQRSTUVW XY Z ABc) digorithm STEP-1: Read the plain text from the user. STEP-2: Read the key value from the user. STEP-3: If the key is positive then encrypt the text by adding the key with each character in the plain text. STEP-4: Else subtract the key from the plain text. STEP-5: Display the…
True or false: A dataword (k) and a codeword (n) vary in that the k=n+FCS (Frame Check Sequence).
make a code , if you can uses mathlab keep basic code no if or return
Let Code C be C = {01011010, 11000001, 01010101} a.) Up to how many errors can the code C detect? b.) Up to how many errors can the code C correct?
Consider the following code which includes a parity check for the third digit: C=(000,011,101,110). You get the third digit by adding the first two and then using the remainder on division by 2. Can this code detect and count single errors? how can this be implemented?