Ask
Login
0
1.5kviews
We know that systematic form of $G = [I_k | P]$
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 70k modified 3.0 years ago by gravatar for sagarkolekar sagarkolekar ★ 11k

Number of bits in codeword n = 6

No. of bits in each message vector K = 3

No. of extra bits added q = n - k = 3

Given

$\begin{bmatrix} \ 1 \hspace{0.5cm} 0 \hspace{0.5cm} 0 & 1 \hspace{0.5cm} 1 \hspace{0.5cm} 1 \\ \ 0 \hspace{0.5cm} 1 \hspace{0.5cm} 0 & 1 \hspace{0.5cm} 1 \hspace{0.5cm} 0\\ \ 0 \hspace{0.5cm} 0 \hspace{0.5cm} 1 & 0 \hspace{0.5cm} 1 \hspace{0.5cm} 1\end{bmatrix}$
digital communication
ADD COMMENT EDIT
1 Answer
0
1views
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 8.7 years ago

$\therefore P = \begin{bmatrix} \ 1 & 1 & 1 \\ \ 1 & 1 & 0 \\ \ 0 & 1 & 1 \\ \end{bmatrix} H = \begin{bmatrix} \ 1 1 0 & 1 0 0 \\ \ 1 1 1 & 0 1 0 \\ \ 1 0 …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.