diff --git a/experiment/images/exp1_0_0_input.png b/experiment/images/exp1_0_0_input.png index 251d730..a53c9b4 100644 Binary files a/experiment/images/exp1_0_0_input.png and b/experiment/images/exp1_0_0_input.png differ diff --git a/experiment/images/exp1_0_0_start.png b/experiment/images/exp1_0_0_start.png index e181f16..4d25f43 100644 Binary files a/experiment/images/exp1_0_0_start.png and b/experiment/images/exp1_0_0_start.png differ diff --git a/experiment/images/exp1_2_2ex2.png b/experiment/images/exp1_2_2ex2.png index e01e4ad..fc2f111 100644 Binary files a/experiment/images/exp1_2_2ex2.png and b/experiment/images/exp1_2_2ex2.png differ diff --git a/experiment/posttest.json b/experiment/posttest.json index c71f19b..24ece0e 100644 --- a/experiment/posttest.json +++ b/experiment/posttest.json @@ -11,11 +11,11 @@ "e": "None" }, "explanations": { - "a": "For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", - "b": "For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", - "c": "For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", - "d": "For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", - "e": "Yes, this is the right answer! All options are valid parity-check matrix of given generator matrix." + "a": "Incorrect. For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", + "b": "Incorrect. For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", + "c": "Incorrect. For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", + "d": "Incorrect. For the given generator matrix, we have number of rows as $k=3$ and the blocklength (number of columns) as $n=6$. Further the three rows of $G$ are linearly independent. Thus, any parity check matrix $H$ should have $n-k=3$ linearly independent rows, and $6$ columns, and should satisfy the property $GH^T=\\boldsymbol{0}_{k\\times n-k}$. The matrix in this option has exactly all these properties. Hence it is a valid parity check matrix. To find the correct answer, look for a matrix which does not have at least one of these three properties.", + "e": "Correct. All options are valid parity-check matrix of given generator matrix." }, "correctAnswer": "e", "difficulty": "intermediate" @@ -29,10 +29,10 @@ "d": "$\\left(0,0,0,0,0,0\\right)$" }, "explanations": { - "a": "Correct option", - "b": "Valid codeword but not correct w.r.t $\\textbf{m}$. For instance first cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 1 + 0\\times 1 + 1\\times 1)\\mod2 = 0$.", - "c": "Valid codeword but not correct w.r.t $\\textbf{m}$. For instance first cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 1 + 0\\times 1 + 1\\times 1)\\mod2 = 0$.", - "d": "Valid codeword but not correct w.r.t $\\textbf{m}$. For instance third cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 0 + 0\\times 0 + 1\\times 0)\\mod2 = 1$." + "a": "Correct.", + "b": "Incorrect. Valid codeword but not correct w.r.t $\\textbf{m}$. For instance first cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 1 + 0\\times 1 + 1\\times 1)\\mod2 = 0$.", + "c": "Incorrect. Valid codeword but not correct w.r.t $\\textbf{m}$. For instance first cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 1 + 0\\times 1 + 1\\times 1)\\mod2 = 0$.", + "d": "Incorrect. Valid codeword but not correct w.r.t $\\textbf{m}$. For instance third cooardinate of the codeword corresponding to message vector will be $(1\\times 1 + 0\\times 0 + 0\\times 0 + 1\\times 0)\\mod2 = 1$." }, "correctAnswer": "a", "difficulty": "beginner" @@ -46,10 +46,10 @@ "d": "$\\left(0,1,1,1\\right)$" }, "explanations": { - "a": "A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", - "b": "Zero-vector is a valid codeword for any linear code. A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", - "c": "A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", - "d": "Correct Option! An invalid vector, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} \\neq \\textbf{0}$." + "a": "Incorrect. A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", + "b": "Incorrect. Zero-vector is a valid codeword for any linear code. A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", + "c": "Incorrect. A valid codeword, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} = \\textbf{0}$.", + "d": "Correct. An invalid vector, $\\textbf{c}$, always satisfy $\\textbf{c}\\textbf{H} \\neq \\textbf{0}$." }, "correctAnswer": "d", "difficulty": "beginner" @@ -63,10 +63,10 @@ "d": "$G = \\begin{bmatrix} 1 & 0 & 1 & 0 \\\\ 1 & 1 & 1 & 0 \\end{bmatrix}$ and message transmitted be $\\left(1,1\\right)$" }, "explanations": { - "a": "Valid Generator matrix but wrong message vector.", - "b": "Invalid Generator matrix corresponding to given code.", - "c": "Correct option!", - "d": "Invalid Generator matrix corresponding to given code." + "a": "Incorrect. Valid Generator matrix but wrong message vector.", + "b": "Incorrect. Invalid Generator matrix corresponding to given code.", + "c": "Correct.", + "d": "Incorrect. Invalid Generator matrix corresponding to given code." }, "correctAnswer": "c", "difficulty": "beginner" @@ -80,13 +80,13 @@ "d": "If the message is $\\left(0,0\\right)$, the corresponding codeword is $\\left(1,0,1,0\\right)$, given $a=1$." }, "explanations": { - "a": "For $\\left(1,0\\right)$ and $a=0$ codeword be $\\left(1,0,1,0\\right)$", - "b": "For $\\left(1,1\\right)$ and $a=1$ codeword be $\\left(1,0,0,1\\right)$", - "c": "Correct option", - "d": "For $\\left(0,0\\right)$ and $a=0$ or $1$ codeword be $\\left(0,0,0,0\\right)$" + "a": "Incorrect. For $\\left(1,0\\right)$ and $a=0$ codeword be $\\left(1,0,1,0\\right)$", + "b": "Incorrect. For $\\left(1,1\\right)$ and $a=1$ codeword be $\\left(1,0,0,1\\right)$", + "c": "Correct.", + "d": "Incorrect. For $\\left(0,0\\right)$ and $a=0$ or $1$ codeword be $\\left(0,0,0,0\\right)$" }, "correctAnswer": "c", "difficulty": "beginner" } ] -} \ No newline at end of file +} diff --git a/experiment/pretest.json b/experiment/pretest.json index 7a4c35c..28fe70e 100644 --- a/experiment/pretest.json +++ b/experiment/pretest.json @@ -10,10 +10,10 @@ "d": "$\\left(0,0,0,1,0,0\\right)$" }, "explanations": { - "a": "Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(1+0)\\mod2 = 1$.", - "b": "Correct Answer!, the modulo-2 sum of each coordinate $((1+1)\\mod2,(0+0)\\mod2,(1+0)\\mod2,(0+1)\\mod2,(1+1)\\mod2,(0+1)\\mod2) = (0,0,1,1,0,1)$.", - "c": "Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(0+1)\\mod2 = 1$.", - "d": "Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(0+1)\\mod2 = 1$." + "a": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(1+0)\\mod2 = 1$.", + "b": "Correct. The modulo-2 sum of each coordinate $((1+1)\\mod2,(0+0)\\mod2,(1+0)\\mod2,(0+1)\\mod2,(1+1)\\mod2,(0+1)\\mod2) = (0,0,1,1,0,1)$.", + "c": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(0+1)\\mod2 = 1$.", + "d": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two vectors. For instance, the first position should be $(1+1)\\mod2 = 0$ and third position should be $(0+1)\\mod2 = 1$." }, "correctAnswer": "b", "difficulty": "beginner" @@ -27,10 +27,10 @@ "d": "$\\begin{bmatrix} 0 & 1 & 1 \\\\ 1 & 0 & 1 \\\\ 1 & 1 & 1 \\end{bmatrix}$" }, "explanations": { - "a": "Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(1,1)}$ position should be $(1\\times 1 + 0\\times 0 + 1\\times 1)\\mod2 = 0$ and $AB_{(2,2)}$ position should be $(1\\times 1 + 1\\times 0 + 0\\times 0)\\mod2 = 1$.", - "b": "Correct Answer! the matrix we get after product is $\\begin{bmatrix} (1\\times 1 + 0\\times 0 + 1\\times 0)\\mod2 & (1\\times 1 + 0\\times 0 + 0\\times 0)\\mod2 & (1\\times 0 + 0\\times 1 + 1\\times 1)\\mod2 \\\\ (1\\times 1 + 1\\times 0 + 0\\times 1)\\mod2 & (1\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 & (1\\times 0 + 1\\times 1 + 1\\times 1)\\mod2 \\\\ (0\\times 1 + 1\\times 0 + 1\\times 1)\\mod2 & (0\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 & (0\\times 0 + 1\\times 1 + 1\\times 1)\\mod2 \\end{bmatrix} = \\begin{bmatrix} 0 & 1 & 1 \\\\ 1 & 1 & 1 \\\\ 1 & 0 & 1 \\end{bmatrix}$", - "c": "Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(3,2)}$ position should be $(0\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 = 0.$", - "d": "Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(2,2)}$ position should be $(1\\times 1 + 1\\times 0 + 0\\times 0)\\mod2 = 1.$" + "a": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(1,1)}$ position should be $(1\\times 1 + 0\\times 0 + 1\\times 1)\\mod2 = 0$ and $AB_{(2,2)}$ position should be $(1\\times 1 + 1\\times 0 + 0\\times 0)\\mod2 = 1$.", + "b": "Correct. The matrix we get after product is $\\begin{bmatrix} (1\\times 1 + 0\\times 0 + 1\\times 0)\\mod2 & (1\\times 1 + 0\\times 0 + 0\\times 0)\\mod2 & (1\\times 0 + 0\\times 1 + 1\\times 1)\\mod2 \\\\ (1\\times 1 + 1\\times 0 + 0\\times 1)\\mod2 & (1\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 & (1\\times 0 + 1\\times 1 + 1\\times 1)\\mod2 \\\\ (0\\times 1 + 1\\times 0 + 1\\times 1)\\mod2 & (0\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 & (0\\times 0 + 1\\times 1 + 1\\times 1)\\mod2 \\end{bmatrix} = \\begin{bmatrix} 0 & 1 & 1 \\\\ 1 & 1 & 1 \\\\ 1 & 0 & 1 \\end{bmatrix}$", + "c": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(3,2)}$ position should be $(0\\times 1 + 1\\times 0 + 1\\times 0)\\mod2 = 0.$", + "d": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the two matrices. For instance, the $AB_{(2,2)}$ position should be $(1\\times 1 + 1\\times 0 + 0\\times 0)\\mod2 = 1.$" }, "correctAnswer": "b", "difficulty": "beginner" @@ -44,10 +44,10 @@ "d": "$\\left(0,1,0\\right)$" }, "explanations": { - "a": "Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 3 position should be $(1+1+0+1) \\mod2 = 1$.", - "b": "Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 2 position should be $(0 + 0 + 0 + 1) \\mod2 = 1$.", - "c": "Correct Answer! sum of four tuple is like $((1 + 0 + 1 + 0) \\mod2,(0 + 0 + 0 + 1) \\mod2,(1 + 1 + 0 + 1) \\mod2) = (0,1,1)$", - "d": "Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 3 position should be $(1+1+0+1) \\mod2 = 1$." + "a": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 3 position should be $(1+1+0+1) \\mod2 = 1$.", + "b": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 2 position should be $(0 + 0 + 0 + 1) \\mod2 = 1$.", + "c": "Correct. The sum of four tuple is like $((1 + 0 + 1 + 0) \\mod2,(0 + 0 + 0 + 1) \\mod2,(1 + 1 + 0 + 1) \\mod2) = (0,1,1)$", + "d": "Incorrect. Please think about the modulo-2 sum of bits in each coordinate in the four vectors. For instance, the 3 position should be $(1+1+0+1) \\mod2 = 1$." }, "correctAnswer": "c", "difficulty": "beginner" @@ -61,10 +61,10 @@ "d": "If we add the vector $\\left(1,0,1,0,1\\right)$ to $S$ and get a new set with $4$ vectors named $S'$, then the set $S'$ is a linear dependent set of vectors." }, "explanations": { - "a": "Given option is linear dependent vector. Verify it be taking linear combination of $\\left(0,1,0,1,1\\right), \\text{ and } \\left(1,1,0,1,1\\right)$ will result in this option.", - "b": "Given option is linear dependent vector. Verify it be taking linear combination of $\\left(1,0,1,0,1\\right), \\text{ and } \\left(1,1,0,1,1\\right)$ will result in this option.", - "c": "Given option is linear independent vector. Verify it be taking any linear combination will not result this given vector.", - "d": "Correct Answer! Given option is linear dependent vector. The option is an element of the vecotr S` thus it's linear dependent vector $\\left(1,1,0,1,1\\right)$." + "a": "Incorrect. Given option is linear dependent vector. Verify it be taking linear combination of $\\left(0,1,0,1,1\\right), \\text{ and } \\left(1,1,0,1,1\\right)$ will result in this option.", + "b": "Incorrect. Given option is linear dependent vector. Verify it be taking linear combination of $\\left(1,0,1,0,1\\right), \\text{ and } \\left(1,1,0,1,1\\right)$ will result in this option.", + "c": "Incorrect. Given option is linear independent vector. Verify it be taking any linear combination will not result this given vector.", + "d": "Correct. Given option is linear dependent vector. The option is an element of the vecotr S` thus it's linear dependent vector $\\left(1,1,0,1,1\\right)$." }, "correctAnswer": "d", "difficulty": "intermediate" @@ -78,10 +78,10 @@ "d": "5" }, "explanations": { - "a": "Correct Answer! Row analysis: All 4 rows are linearly independent. Column analysis: Since second column is all zero thus rank is less than equal to 4. Rest 4 columns are linear independent.", - "b": "Please think about including 1 more linear independent rows or columns.", - "c": "Please think about including 2 more linear independent rows or columns.", - "d": "Number of rows is 4 then surely $rank(R) \\leq 4$" + "a": "Correct. Row analysis: All 4 rows are linearly independent. Column analysis: Since second column is all zero thus rank is less than equal to 4. Rest 4 columns are linear independent.", + "b": "Incorrect. Please think about including 1 more linear independent rows or columns.", + "c": "Incorrect. Please think about including 2 more linear independent rows or columns.", + "d": "Incorrect. Number of rows is 4 then surely $rank(R) \\leq 4$" }, "correctAnswer": "a", "difficulty": "intermediate" diff --git a/experiment/procedure.md b/experiment/procedure.md index d4cb3d6..5ab97db 100644 --- a/experiment/procedure.md +++ b/experiment/procedure.md @@ -1,128 +1,124 @@ -The experiment consists of two sub-experiments. The user is recommended to go through these in the same sequence as they are presented. +The experiment consists of two sub-experiments. The user is recommended to go through these in the same sequence as they are presented. -0. Dimension of linear block code and its rate. - * Given generator matrix and/or parity check matrix, write down the dimension of the code and its rate. +0. Dimension of linear block code and its rate. + - Given generator matrix and/or parity check matrix, write down the dimension of the code and its rate. 1. Encoding - * For given generator matrix of the linear code, learn how to encode a message vector + - For given generator matrix of the linear code, learn how to encode a message vector 2. Learn how to calculate minimum distance. - * For given generator matrix, calculate all codewords and the minimum weight. -3. Learn how to compute parity check matrix, given generator matrix in systematic form. - * Compute the two blocks $I_{n-k}$ and $P^T$ and the overall structure of the parity check matrix. + - For given generator matrix, calculate all codewords and the minimum weight. +3. Learn how to compute parity check matrix, given generator matrix in systematic form. + - Compute the two blocks $I_{n-k}$ and $P^T$ and the overall structure of the parity check matrix. 4. Learn to identify the codewords - * Given parity check matrix, check if given vector is a codeword or not. + - Given parity check matrix, check if given vector is a codeword or not. - -## Overview of the Experiment window +### Overview of the Experiment window
alt text
The experiment window consists of the following components: + 1. **Task tab**: The task tab contains the list of tasks that need to be performed in the experiment. The user can navigate to any task by clicking on the corresponding task in the task tab. 2. **Instruction box**: The instruction box displays step-by-step instructions to perform the task. 3. **Question box**: The question box displays the question to be answered by the user. 4. **Observation box**: The observation box displays the feedback messages based on the user's input. 5. **Action box**: The action box contains the input elements and buttons to perform the task. - -## Sub-Experiment 1: Review of Linear Block Codes +### Sub-Experiment 1: Review of Linear Block Codes There are three tasks in this sub-experiment. -### Task 1: Dimension and Rate +#### Task 1: Dimension and Rate -1. **Find Dimension**: Enter the dimension of the matrix shown in the input box provided as shown in the figure below. -
alt text
+1. **Find Dimension**: Enter the dimension of the matrix shown in the input box provided as shown in the figure below. +
alt text
2. **Verify the Matrix**: Determine if the matrix is a valid generator matrix.
-
alt text

- - Click on **Yes!** if the matrix is a valid generator matrix. - - Click on **No!** if the matrix is not a valid generator matrix. - - The observation box will display the feedback message accordingly.
-
- alt text - alt text - alt text -
+
alt text

+- Click on **Yes!** if the matrix is a valid generator matrix. +- Click on **No!** if the matrix is not a valid generator matrix. +- The observation box will display the feedback message accordingly.
+
+ alt text + alt text + alt text +
3. **Calculate Code Rate**: Once a true generator matrix is identified and confirmed, calculate the rate of the code. The rate is given by the ratio of the dimension to the block length (length of the code). Enter the dimension and the block length in the input boxes provided.
- alt text
- - Click on **Check** to verify the correctness of the rate. The Observation box will display the feedback message accordingly. - + alt text
+ - Click on **Check** to verify the correctness of the rate. The Observation box will display the feedback message accordingly. -### Task 2: Encoding +#### Task 2: Encoding 1. **Encode Message**: Enter the message vector by clicking on the message bits.
- alt text
- - Click on **Encode** to encode the message vector. The entered codeword will be displayed in the Observation box and you will be take to next step. + alt text
-2. **Enter Codeword**: Enter the codeword by clicking on the codeword bits.
- alt text
- - Click on **Check** to verify the correctness of the codeword. The Observation box will display the feedback message accordingly. + - Click on **Encode** to encode the message vector. The entered codeword will be displayed in the Observation box and you will be take to next step. +2. **Enter Codeword**: Enter the codeword by clicking on the codeword bits.
+ alt text
+ - Click on **Check** to verify the correctness of the codeword. The Observation box will display the feedback message accordingly. -### Task 3: Minimum Distance +#### Task 3: Minimum Distance 1. **Enter all codewords and hamming weight**: Enter all the codewords by clicking on the codeword bits and input the corresponding Hamming weight in the input box provided.
- alt text
- - Click on **Next** to verify the correctness of the minimum distance. The Observation box will display the feedback message accordingly. + alt text
-2. **Enter the minimum distance**: Enter the minimum distance of the code in the input box provided.
- alt text
- - Click on **Check** to verify the correctness of the minimum distance. The Observation box will display the feedback message accordingly. + - Click on **Next** to verify the correctness of the minimum distance. The Observation box will display the feedback message accordingly. +2. **Enter the minimum distance**: Enter the minimum distance of the code in the input box provided.
+ alt text
+ - Click on **Check** to verify the correctness of the minimum distance. The Observation box will display the feedback message accordingly. -## Sub-Experiment 2: Parity Check Matrix +### Sub-Experiment 2: Parity Check Matrix There are two tasks in this sub-experiment. -### Task 1: Structure of the parity-check matrix +#### Task 1: Structure of the parity-check matrix -1. **Find Dimensions of Matrices**: Enter the dimension of the matrices shown in the input boxes as row x column as shown in the figure below. - alt text - +1. **Find Dimensions of Matrices**: Enter the dimension of the matrices shown in the input boxes as row x column as shown in the figure below. + alt text 2. **Verify Matrices**: To check the dimensions of matrices are correct.
- alt text
- - Click on **Submit** and check the dimensions of the matrices are valid. - - Click on **Reset** to clear all the box entries. - - Click on **Next** to go to the next sub-experiment. - - The observation box will display the feedback message accordingly.
- - alt text - alt text - alt text + alt text
+ + - Click on **Submit** and check the dimensions of the matrices are valid. + - Click on **Reset** to clear all the box entries. + - Click on **Next** to go to the next sub-experiment. + - The observation box will display the feedback message accordingly.
+ + alt text + alt text + alt text 3. **Fill out the sub-matrix entries**: For given blue 3x3 boxes fill out the bits into it.
- alt text
- To check the dimensions of matrices are correct or not.
- alt text
- - Click on **Submit** to verify the filled entries are right or wrong. - - Click on **Reset** to clear all the box entries. - - Click on **Previous** to go to the previous sub-experiment. - - The observation box will display the feedback message accordingly.
- - alt text - alt text - alt text - - - -### Task 2: Identify Codewords + alt text
+ To check the dimensions of matrices are correct or not.
+ alt text
+ - Click on **Submit** to verify the filled entries are right or wrong. + - Click on **Reset** to clear all the box entries. + - Click on **Previous** to go to the previous sub-experiment. + - The observation box will display the feedback message accordingly.
+ + alt text + alt text + alt text + +#### Task 2: Identify Codewords 1. **Select Codewords**: Select the boxes given. After selecting, it will turn green, and it will turn back to gray boxes for deselecting.
- alt text - alt text
- To check the dimensions of matrices are correct or not.
- alt text alt text
-
    -
  • Click on Submit to verify the filled entries are right or wrong.
    • -
  • Click on Reset to clear all the box entries.
    • -
  • Click on Next to go to the next sub-experiment.
    • -
  • Click on Previous to go to the previous sub-experiment.
    • -
  • The observation box will display the feedback message accordingly.

    • -
- alt text - alt text - alt text - \ No newline at end of file +alt text +alt text
+To check the dimensions of matrices are correct or not.
+alt text alt text
+
    +
  • Click on Submit to verify the filled entries are right or wrong.
    • +
  • Click on Reset to clear all the box entries.
    • +
  • Click on Next to go to the next sub-experiment.
    • +
  • Click on Previous to go to the previous sub-experiment.
    • +
  • The observation box will display the feedback message accordingly.

    • +
+ alt text + alt text + alt text + diff --git a/experiment/simulation/dimension_linear_block.html b/experiment/simulation/dimension_linear_block.html index cc14c3e..02d01ab 100644 --- a/experiment/simulation/dimension_linear_block.html +++ b/experiment/simulation/dimension_linear_block.html @@ -122,6 +122,7 @@ + diff --git a/experiment/simulation/minimum_distance.html b/experiment/simulation/minimum_distance.html index e776f60..4a94c89 100644 --- a/experiment/simulation/minimum_distance.html +++ b/experiment/simulation/minimum_distance.html @@ -142,6 +142,7 @@
+ - +