Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 1 - Data Storage - Section 1.10 - Communication Errors - Questions & Exercises - Page 84: 5

Answer

The error-correcting code was designed for errors that can be not only detected but also corrected. Here, the table below shows the simple code for the symbols: using the table in the image below This code works by the Hamming distance. The Hamming distance between two-bit patterns is the number of bits in which the patterns differ. The least hamming distance would be the closest match for the bit pattern. therefore the solution will be: a. BED b. CAB c. HEAD
1561746484

Work Step by Step

The error-correcting code was designed for errors that can be not only detected but also corrected. Here, the table below shows the simple code for the symbols: using the table in the image below This code works by the Hamming distance. The Hamming distance between two-bit patterns is the number of bits in which the patterns differ. The least hamming distance would be the closest match for the bit pattern. therefore the solution will be: a. BED b. CAB c. HEAD
Small 1561746484
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.