Q2/ The following data stream (10011011 11001110 11110000 10001000 11100000 11011010 11111111 01110111 10011001 11100111 01011010) will be transmitted with signaling rate equal to 80 k bit/sec. Find the Hamming code of the last byte of the data only in which two error can be detected and one error can be corrected, calculate the transmitted bandwidth? how can reduce the transmitted bandwidth? Explain and calculate the reduced transmitted bandwidth? By using the following polynomial calculate the data transmitted of the (first byte of the data only) (p= x5 +x3 +x+l).

Q2/ The following data stream (10011011 11001110 11110000 10001000 11100000 11011010 11111111 01110111 10011001 11100111 01011010) will be transmitted with signaling rate equal to 80 k bit/sec. Find the Hamming code of the last byte of the data only in which two error can be detected and one error can be corrected, calculate the transmitted bandwidth? how can reduce the transmitted bandwidth? Explain and calculate the reduced transmitted bandwidth? By using the following polynomial calculate the data transmitted of the (first byte of the data only) (p= x5 +x3 +x+l).

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 4VE

See similar textbooks

Similar questions

4-The following block is sent: 0110111 0101010 1101010 1010101. Using a 2-dimensional parity check, what will be received by the receiver without the block being corrupted in transmission. put a space after each frame (8 bits). your final answer shoule be 5 frames. 5-Given: Original message : 110101010; Generator: 1010 Perform a CRC Calculation: 6-The symbols M and N are transmitted. Show the transmission of this data (at the sender and receiver) using Checksum Method.
With the use of a Checksum Method, show the transmission of “m” and “n” from the sender to destination side. The following block is sent: 00001111 11110000 11001100 10101010. With the use of a two-dimensional parity check and assuming that no single/multiple-bit or burst error have occurred, what will be received in the receiver side? NOTE: Put a space after each frame.
Suppose the sender and the receiver agree to use the bit pattern 01111110 to mark the beginning and the end of a frame. 1)The sender has the following bits to send. What does the sender actually send? 011110000111111011101111101 2) The receiver receives the following bits. What're the original data bits (note: this question has nothing to do with the previous question) 01111110111110111110001101111101000011111001111110
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
Decode the following messages that encounter noises in the channel where the channel encoding uses repetition code where k=3. 1.) 101101011100110 2.) 010010001010011 3.) 111110110010100 4.) 100100001010010
suppose an even parity code is used to send a message across a noisy channel. which of the ff received word is sure to contain at least one error? a. 10101011 b. 111111 c. 000000 d. 001111
Assume that the channel introduces an error pattern “110100000110111011110111010100000001110100011010111011001000011”(Each bit transmitted 3 times). What is received? (:-Use Majority voting algorithm). Can the error be detected? Convert detected code into ASCII message
What are the CRC bits (R) associated with the payload containing first four bit 1101 and last four bit is the last digit of your reg number (i.e. 5, payload = 1101 0101). Suppose that the 4-bit generator (G) is 0101, and r = 3
1. One way of detecting errors is to transmit data as a block of n rows of k bits per row and add parity bits to each row and each column (for this problem k is >=5). The bit in the lower-right corner is a parity bit that checks its row and its column. This scheme will detect burst errors of length 5? (A) TRUE (B) FALSE 2. According to Shannon, if the amount of Signal is increased on a transmission medium, everything else constant, the expected theoretical bitrate would (A) increase (B) decrease (C) remain the same (D) cannot determine 3. In nonpersistent CSMA, if a transmitter ready to transmit senses the channel is busy, the transmitter waits a random amount of time, and senses the line again. If it’s still busy it repeats the process, otherwise it transmits the data. (A) True (B) False
Please help with the following question: What is the parity bit for each of the following messages using even parity? a. 10011101100110110 b. 01000101110101011 c. 01110111100100010 d. 00101101011100100
In a two-dimensional decimal parity-check which uses check digits, if we receive the following transmission: 257103550 Assuming there is at most 1 error, which of the following is the correct original underlying message: a) 257303550 b) 217503550 c) 2150 d) 7355 e) 2530
The following character encoding is used in a data link protocol: A: 01000111; B: 11100011; FLAG: 01111110; ESC: 11100000 Show the bit sequence transmitted in binary for the four character frame: A B ESC FLAG when each of the following framing methods is used: a) Character count b) Flag bytes with byte stuffing c) Starting and ending flag bytes, with bit stuffing. Please solve within 30 minutes. Asap.