When a message is transmitted in secret code over a transmission channel, it is usually transmitted as a sequence of bits (0s and 1s) • Due to noise in the transmission channel, the transmitted message may become corrupted − Message received at destination is not the same as the message transmitted − Some of the bits may have been changed Several techniques to check the validity of the transmitted message at the destination • One technique is to transmit the same message twice − At the destination, both copies of the message are compared bit by bit − If the corresponding bits are the same, the message received is error-free We write a program to check if the message received at the destination is error-free • For simplicity, assume that: − The secret code representing the message is a sequence of digits (0 to 9) − The maximum length of the message is 250 digits • The first number in the message is the length of the message If the secret code is 7 9 2 7 8 3 5 6 then the message is seven digits long • The above message is transmitted (twice) as 7 9 2 7 8 3 5 6 7 9 2 7 8 3 5 6 • Input: a file containing the secret code and its copy • Output: the secret code, its copy, and a message if the received code is error-free The results are output in the following form: Code Digit Code Digit Copy 9 9 2 2 7 7 8 8 3 3 5 5 6 6 • Message transmitted OK

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

When a message is transmitted in secret code over a transmission channel, it is usually transmitted as a sequence of bits (0s and 1s) • Due to noise in the transmission channel, the transmitted message may become corrupted − Message received at destination is not the same as the message transmitted − Some of the bits may have been changed Several techniques to check the validity of the transmitted message at the destination • One technique is to transmit the same message twice − At the destination, both copies of the message are compared bit by bit − If the corresponding bits are the same, the message received is error-free We write a program to check if the message received at the destination is error-free • For simplicity, assume that: − The secret code representing the message is a sequence of digits (0 to 9) − The maximum length of the message is 250 digits • The first number in the message is the length of the message If the secret code is 7 9 2 7 8 3 5 6 then the message is seven digits long • The above message is transmitted (twice) as 7 9 2 7 8 3 5 6 7 9 2 7 8 3 5 6 • Input: a file containing the secret code and its copy • Output: the secret code, its copy, and a message if the received code is error-free The results are output in the following form: Code Digit Code Digit Copy 9 9 2 2 7 7 8 8 3 3 5 5 6 6 • Message transmitted OK

Expert Solution