LDPC Codes: Introduction

1. Consider the parity-check matrix H=[110101111010]H = \begin{bmatrix} 1 & 1 & 0 & 1 \\ 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 0 \end{bmatrix} over GF(2)GF(2). What is the rank of this matrix?

Explanation

Explanation

Explanation

Explanation

2. For the parity-check matrix H=[1011001011]H = \begin{bmatrix} 1 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 1 & 1 \end{bmatrix}, which equation represents the first parity check?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

3. Given H=[11100111]H = \begin{bmatrix} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 \end{bmatrix}, which of the following is a valid codeword?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

4. A graph G(V,E)G(V, E) is called bipartite if VV can be partitioned into V1V_1 and V2V_2 such that no edge connects two vertices of the same partition. What is the maximum number of edges a bipartite graph can have?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

5. If a parity-check matrix has nn columns and its rows are all linearly independent, what is the rank of the matrix?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation