Cryptography Reference
In-Depth Information
00
00
00
00
00
(000)
11
11
11
01
01
(001)
10
10
11
11
00
11
00
00
(010)
11
11
01
10
01
10
(011)
01
01
01
01
(100)
10
10
10
10
00
11
00
11
(101)
01
10
01
01
(110)
10
10
00
00
(111)
11
11
(1)
(1)
(2)
i
r
i
r
i
d
i
d
i
=0
=1
(2)
r
Figure 5.12 - RTZ sequence (in bold) defining the free distance of the code with
generator polynomials
[1
,
1+
D
+
D
3
]
.
00
00
00
00
00
00
(000)
11
11
11
11
11
11
11
(001)
00
00
00
11
11
10
01
10
01
10
10
(010)
01
01
01
10
01
01
(011)
01
10
10
01
10
01
01
01
(100)
10
10
10
10
10
01
10
01
10
01
(101)
11
11
00
11
00
11
00
(110)
00
00
00
00
(111)
11
11
11
(1)
(1)
(2)
i
r
i
r
i
d
i
d
i
=0
=1
(2)
r
Figure 5.13 - RTZ sequences (in bold) defining the free distance of the code with
generator polynomials
[1 +
D
2
+
D
3
,
D
3
]
1+
D
+
.
00
00
00
00
00
00
(000)
11
11
11
00
11
11
00
11
11
(001)
00
11
11
01
10
01
10
01
01
10
01
01
(010)
10
01
10
10
10
(011)
10
10
10
10
10
(100)
01
01
01
01
01
01
01
10
01
(101)
10
10
11
11
00
11
00
11
00
(110)
00
00
00
00
(111)
11
11
11
(2)
(2)
d
d
r
i
r
i
d
i
d
i
=0
=1
Figure 5.14 - RTZ sequences (in bold) defining the free distance of the code with
generator polynomials
D
2
+
D
3
)
D
3
)]
[1
,
(1 +
/
(1 +
D
+
.
the non-recursive systematic code, the only sequence of this type has a weight
