[[File:P_ID2525__KC_A_2_8.png|right|frame|Four generator matrices, three of which describe Reed-Solomon codes]]
[[File:P_ID2525__KC_A_2_8.png|right|frame|Four generator matrices, three of which describe Reed-Solomon codes]]
In the [[Aufgaben:Exercise_2.07:_Reed-Solomon_Code_(7,_3,_5)_to_Base_8|"Exercise 2.7"]] you should determine the codewords of the $\rm RSC \, (7, \, 3, \, 5)_8$ via a polynomial. However, you can also determine the codeword $\underline{c}$ from the information word $\underline{u}$ and the generator matrix $\mathbf{G}$ according to the following equation:
In the [[Aufgaben:Exercise_2.07:_Reed-Solomon_Code_(7,_3,_5)_to_Base_8|"Exercise 2.7"]] you should determine the code words of the $\rm RSC \, (7, \, 3, \, 5)_8$ via a polynomial. However, you can also determine the code word $\underline{c}$ from the information word $\underline{u}$ and the generator matrix $\mathbf{G}$ according to the following equation:
*Two of these generator matrices describe the $\rm RSC \, (7, \, 3, \, 5)_8$. In the subtask '''(1)''' is explicitly asked which.
*Another generator matrix belongs to $\rm RSC \, (7, \, 5, \, 3)_8$, which is considered in subtask '''(3)'''.
*Two of these generator matrices describe the $\rm RSC \, (7, \, 3, \, 5)_8$. In the subtask '''(1)''' is explicitly asked which.
*Another generator matrix belongs to $\rm RSC \, (7, \, 5, \, 3)_8$, which is considered in subtask '''(3)'''.
Line 14:
Line 13:
Hints:
* This exercise belongs to the chapter [[Channel_Coding/Definition_and_Properties_of_Reed-Solomon_Codes| "Definition and Properties of Reed-Solomon Codes"]].
Hints:
* Important information about Reed–Solomon codes can also be found in [[Aufgaben:Exercise_2.07:_Reed-Solomon_Code_(7,_3,_5)_to_Base_8| "Exercise 2.7"]].
* This task belongs to the chapter [[Channel_Coding/Definition_and_Properties_of_Reed-Solomon_Codes| "Definition and Properties of Reed-Solomon Codes"]].
* Important information about Reed–Solomon codes can also be found in the [[Aufgaben:Exercise_2.07:_Reed-Solomon_Code_(7,_3,_5)_to_Base_8| "Exercise 2.7"]].
Line 32:
Line 31:
- the matrix $\mathbf{G}_{\rm D}$.
- the matrix $\mathbf{G}_{\rm D}$.
{The information sequence starts with $\alpha^4, \, 1, \, \alpha^3, \, 0, \, \alpha^6$. Determine the first codeword for the $\rm RSC \, (7, \, 3, \, 5)_8$.
{The information sequence starts with $\alpha^4, \, 1, \, \alpha^3, \, 0, \, \alpha^6$. Determine the first code word for the $\rm RSC \, (7, \, 3, \, 5)_8$.
|type="[]"}
|type="[]"}
+ It holds $c_0 = \alpha^2$,
+ It holds $c_0 = \alpha^2$,
Line 38:
Line 37:
- It holds $c_6 = 0$.
- It holds $c_6 = 0$.
{What is the codeword for the $\rm RSC \, (7, \, 5, \, 3)_8$ given the same sequence of information?
{What is the code word for the $\rm RSC \, (7, \, 5, \, 3)_8$ given the same sequence of information?
|type="[]"}
|type="[]"}
+ It holds $c_0 = 1$,
+ It holds $c_0 = 1$,
Line 47:
Line 46:
===Solution===
===Solution===
{{ML-Kopf}}
{{ML-Kopf}}
'''(1)''' Correct are the <u>solutions 2 and 3</u> ⇒ matrices $\mathbf{G}_{\rm B}$ and $\mathbf{G}_{\rm C}$.
'''(1)''' Correct are the <u>solutions 2 and 3</u> ⇒ matrices $\mathbf{G}_{\rm B}$ and $\mathbf{G}_{\rm C}$.
*In the matrix $\mathbf{G}_{\rm C}$ the allowed transformations $\alpha^8 = \alpha, \ \alpha^{10} = \alpha^3$ and $\alpha^{12} = \alpha^5$ have already been considered.
*In the matrix $\mathbf{G}_{\rm C}$ the allowed transformations $\alpha^8 = \alpha, \ \alpha^{10} = \alpha^3$ and $\alpha^{12} = \alpha^5$ have already been considered.
*The matrix $\mathbf{G}_{\rm A}$ holds for the $(7, \, 5, \, 3)$–Hamming code and $\mathbf{G}_{\rm D}$ belongs to the $\rm RSC \, (7, \, 5, \, 3)_8$. See subtask (3) for more details.
*The matrix $\mathbf{G}_{\rm A}$ holds for the $(7, \, 5, \, 3)$ Hamming code and $\mathbf{G}_{\rm D}$ belongs to the $\rm RSC \, (7, \, 5, \, 3)_8$. See subtask '''(3)''' for more details.
'''(2)''' In the $\rm RSC \, (7, \, 3, \, 5)_8$ information symbols are processed in each coding step $k = 3$, in coding step 1 according to the specification the symbols $\alpha^4, \ 1$ and $\alpha^3$.
'''(2)''' In the $\rm RSC \, (7, \, 3, \, 5)_8$, in each coding step are processed $k = 3$ information symbols, <br>in coding step 1 according to the specification the symbols $\alpha^4, \ 1$ and $\alpha^3$.
[[File:P_ID2584__KC_T_2_5_Darstellung.png|right|frame|$\rm GF(2^3)$ as powers, polynomials and vectors ]]
*With the generator matrix $\mathbf{G}_{\rm C}$ thus holds:
*With the generator matrix $\mathbf{G}_{\rm C}$ thus holds:
*You get exactly the same result as in subtask (4) of [[Aufgaben:Aufgabe_2.07:_Reed–Solomon–Code_(7,_3,_5)_zur_Basis_8|"Exercise 2.7"]]. Correct are <u>solutions 1 and 2</u>.
*You get exactly the same result as in subtask '''(4)''' of [[Aufgaben:Exercise_2.07:_Reed-Solomon_Code_(7,_3,_5)_to_Base_8|"Exercise 2.7"]]. Correct are the <u>solutions 1 and 2</u>.
*So it is not $c_6 = 0$, but $c_6 = 1$.
*So it is not $c_6 = 0$, but $c_6 = 1$.
'''(3)''' At $\rm RSC \, (7, \, 5, \, 3)_8$, the information word $\underline{u} = (u_0, \, u_1, \, u_2, \, u_3, \, u_4)$ must be considered.
'''(3)''' At the $\rm RSC \, (7, \, 5, \, 3)_8$, the information word $\underline{u} = (u_0, \, u_1, \, u_2, \, u_3, \, u_4)$ must be considered.
*With the generator matrix $\mathbf{G}_{\rm D}$ one obtains:
*With the generator matrix $\mathbf{G}_{\rm D}$ one obtains:
*This takes into account that the bracket expression $[ \ \text{...} \ ]$ corresponds exactly to the result $c_1$ of subtask (2).
*This takes into account that the bracket expression $[ \ \text{...} \ ]$ corresponds exactly to the result $c_1$ of subtask '''(2)'''.
*Corresponding is also considered in the following calculations:
*Corresponding is also considered in the following calculations:
Four generator matrices, three of which describe Reed-Solomon codes
In the "Exercise 2.7" you should determine the code words of the $\rm RSC \, (7, \, 3, \, 5)_8$ via a polynomial. However, you can also determine the code word $\underline{c}$ from the information word $\underline{u}$ and the generator matrix $\mathbf{G}$ according to the following equation:
(1) Correct are the solutions 2 and 3 ⇒ matrices $\mathbf{G}_{\rm B}$ and $\mathbf{G}_{\rm C}$.
In the matrix $\mathbf{G}_{\rm C}$ the allowed transformations $\alpha^8 = \alpha, \ \alpha^{10} = \alpha^3$ and $\alpha^{12} = \alpha^5$ have already been considered.
The matrix $\mathbf{G}_{\rm A}$ holds for the $(7, \, 5, \, 3)$ Hamming code and $\mathbf{G}_{\rm D}$ belongs to the $\rm RSC \, (7, \, 5, \, 3)_8$. See subtask (3) for more details.
(2) In the $\rm RSC \, (7, \, 3, \, 5)_8$, in each coding step are processed $k = 3$ information symbols, in coding step 1 according to the specification the symbols $\alpha^4, \ 1$ and $\alpha^3$.
With the generator matrix $\mathbf{G}_{\rm C}$ thus holds: