Answered: Consider 7-bit messages that we encode…

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

Related questions

Concept explainers

Question

100%

Consider 7-bit messages that we encode into 11-bit codewords using 4 parity bits. Thus our codewords look like:

⟨a, b, c, d, e, f, g, p₁, p₂, p₃, p₄⟩

where a, b, c, d, e, f, g are the original 7-bits of the message, and p₁, p₂, p₃, p₄are 4 parity bits. Recall the two properties from Tutorial 2:

(0) each bit of the original message appears in at least two parity bits, and
(1) no two bits of the original message appear in exactly the same set of parity bits.

For the following proposed parity bits, select whether they satisfy property (0), property (1), both, or neither.

p₁ = a ⊕ d ⊕ e
p₂ = a ⊕ b ⊕ e ⊕ f
p₃ = b ⊕ c ⊕ f ⊕ g
p₄ = c ⊕ d ⊕ g

Question 1 options:

a	neither property
b	both properties
c	only property (0)
d	only property (1)

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions