This preview shows
page 1. Sign up
to
MATH 3360 – Applicable Algebra.
HW 11
Solutions
(1) Problem 13 on page 162.
Solution:
Consider
C
=
(
x
,
y
,
z
,
a
,
b
,
c
,
d
)
T
. Then
x
y
z
a
b
c
d
=
1
1
0
1
1
0
1
1
0
1
1
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
a
b
c
d
.
From here, you see that
G
0
=
P
--
I
.
(2) Problem 2.3.
Solution:
Note that here there are many correct answers. Here is one of them:
G
=
1
0
0
1
0
0
0
0
1
0
1
0
0
1
1
0
0
1
This is the end of the preview.
Sign up
to
access the rest of the document.
- Spring '08
- BILLERA
- Algebra, Binary numeral system, Coding theory, Hamming Code, nontrivial combination, distinct nonzero columns
-
Click to edit the document details
