sider 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, p1, p2, p3, p4⟩ where a, b, c, d, e, f, g are the original 7-bits of the message, and p1, p2, p3, p4 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
discrete structures
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, p1, p2, p3, p4⟩
where a, b, c, d, e, f, g are the original 7-bits of the message, and p1, p2, p3, p4 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.
p1 = a ⊕ c ⊕ d ⊕ f
p2 = a ⊕ b ⊕ d ⊕ f ⊕ g
p3 = a ⊕ b ⊕ c ⊕ e ⊕ g
p4 = b ⊕ c ⊕ d ⊕ e
Question 2 options:
|
a
|
neither property |
|
b
|
both properties |
|
c
|
only property (0) |
|
d
|
only property (1) |
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
