This problem concerns the code based on the 31-hat game. Here the message should be decomposed into blocks of length 31-5 = 26. Suppose that one of the 26-blocks in the starting message has eight 0's followed by ten 1's, followed by eight 0's. That is, it is 00000000111111111100000000 (a) Find its associated L-node, which is the code word which will be transmitted. (b) Suppose that in the transmission, there is an error in the 20th character. Give a detailed account of the calculations made by the decoder to recover the original message.

This problem concerns the code based on the 31-hat game. Here the message should be decomposed into blocks of length 31-5 = 26. Suppose that one of the 26-blocks in the starting message has eight 0's followed by ten 1's, followed by eight 0's. That is, it is 00000000111111111100000000 (a) Find its associated L-node, which is the code word which will be transmitted. (b) Suppose that in the transmission, there is an error in the 20th character. Give a detailed account of the calculations made by the decoder to recover the original message.

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

Suppose you have a signature scheme S (which is correct and existentially unforgeable), and S can be used to sign any t-bit message. And you have a hash function H which outputs t bits and is collision-resistant. Consider a modified signature scheme S’ which can sign messages of unlimited length, where: S’.Sign(sk, m) = S.sign(sk, H(m)) Prove that this scheme is existentially unforgeable as long as S is existentially unforgeable and H is collision-resistant.
A network consists of n nodes in a ring, where n is odd: All the nodes have the same closeness centrality. What is it, give an expression for it as a function of n?
When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56
Hash functions and signatures: Signature schemes are typically defined to work for a finite domain of possible message (the message spaces). Suppose you have a signature scheme S which is correct and secure (existentially unforgeable) for domain M={0,1}t, that is, S can be used to sign any t-bit message. Suppose you also have a hash function H which outputs t bits and is collision-resistant. Consider a modified signature scheme S’ which can sign messages of unlimited length, where: S’.Sign(sk, m) = S.sign(sk, H(m)) Prove that this scheme is existentially unforgeable as long as S is existentially unforgeable and H is collision-resistant.
Suppose Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”GD” (in ASCII) with key " H”(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 suffix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob.
There is a data set that describes the email contacts between people in a University department. The data set is as follows: 0 1 0 2 0 6 1 0 1 3 1 5 2 0 2 4 3 1 3 5 3 6 4 2 4 5 5 1 5 3 5 4 6 0 6 3 There are totally 7 ids, representing 7 individuals. The two columns are the ids of persons. The id pair in a row represents an email contact relationship between the node pairs. For example, the first row ‘0 1’ means an individual with id 0 and an individual with id 1 have an email contact. All the individuals and their relationship constitute an email contact network, which is a graph in data structure. Based on the data set, please implement the following tasks: Establish a graph data structure using the adjacent list method. Source code: Running snapshot: Let node 0 as the origin and do the BFS traverse of the graph. Print out the BFS traverse…
In order to send a request to the master replica of a data item, a node must know which replicais the master for that data item. a. Suppose that between the time the node identifies whichnode is the master replica for a data item, and the time the request reaches the identifiednode, the mastership has changed, and a different node is now the master. How can such asituation be dealt with?
The following system is proposed for securely communicating a 256-bit message m:A→B:i,m⊕h(i)That is, Alice sends Bob an integer i and the message m xor'ed with a SHA-256 hash of i. (SHA-256 produces a 256-bit digest, so the lengths of h(i) and m are equal.) Bob can decode the message m⊕h(i) by hashing i (which is communicated as plaintext), and can thus derive m, since (m⊕h(i))⊕h(i)=m.Show that this scheme is very broken and that a passive eavesdropper can trivially learn m.
This question relates to hash functions for block ciphers Block size = 4 bits Hash size = 4 bits Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into two halves: LT and RT; Then ciphertext= LC||RC where LC=LK XOR RT; and RC = RK XOR LT; where LC, RC, LT, and RT are each 2 bits; Plaintext and ciphertext are each 4 bits. g(H) = a 4-bit string that is equal to the complement of bits in H; For example, if H=A (Hexa) = 1010 (binary); then g(H)= 0101 H0 = Initial hash = C (in Hexa) Given message M: D9 (in Hexa); a. Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function b. Determine the hash (in hexadecimal) of the message M using Davis-Meyer hash function c. Determine the hash (in hexadecimal) of the message M using Migayuchi-Preneel hash function
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS SSTF SCAN LOOK C-SCAN C-LOOK
Consider a 64-bit hash function H(x). Describe an efficient algorithm allowing you to find a pair of messages M, M0 such that H(M) = H(M0 ). Describe what resources (i.e. time and memory complexity) it would require to find such a pair
Each node will send a Notify message to all its neighbors when it becomes part of the tree: States: S = { INITIATOR, IDLE, AWAKE, ACTIVE, WAITING FOR ACK, COMPUTING,DONE };SINIT = { INITIATOR,IDLE }; STERM = { DONE }. Restrictions: IR ; UI. Consruct an algorithm for shortest path routing?