Creating the generator matrix of the linear block-code
$begingroup$
How can i create a generator matrix for $(5,3)$ Linear block-code over $GF(2^2)$.
Most of the books mention the operations on this matrix and also that the choice of the basis vector is not unique that is the reason that a code can have different generator matrices. I know the rows of the matrix should be linearly independen but i don't understand how do i create generator matrix over a Galois field?
A concrete question because the above written question was not clear:
Suppose i have a paritytestmatrix =
$begin{bmatrix}
1 & alpha & alpha^2 & 1 & 0 \
1 &1 & 1& 0 &1 \
end{bmatrix}$
$alpha$ is a root of $x^2 + x + 1$. Now i know that $G = [I_k|P]$. How do i go in opposite direction? Inverse of a indentity matrix is same.
A little bit explaination would be enough.
matrices cryptography coding-theory
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
$endgroup$
add a comment |
$begingroup$
How can i create a generator matrix for $(5,3)$ Linear block-code over $GF(2^2)$.
Most of the books mention the operations on this matrix and also that the choice of the basis vector is not unique that is the reason that a code can have different generator matrices. I know the rows of the matrix should be linearly independen but i don't understand how do i create generator matrix over a Galois field?
A concrete question because the above written question was not clear:
Suppose i have a paritytestmatrix =
$begin{bmatrix}
1 & alpha & alpha^2 & 1 & 0 \
1 &1 & 1& 0 &1 \
end{bmatrix}$
$alpha$ is a root of $x^2 + x + 1$. Now i know that $G = [I_k|P]$. How do i go in opposite direction? Inverse of a indentity matrix is same.
A little bit explaination would be enough.
matrices cryptography coding-theory
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
$endgroup$
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45
add a comment |
$begingroup$
How can i create a generator matrix for $(5,3)$ Linear block-code over $GF(2^2)$.
Most of the books mention the operations on this matrix and also that the choice of the basis vector is not unique that is the reason that a code can have different generator matrices. I know the rows of the matrix should be linearly independen but i don't understand how do i create generator matrix over a Galois field?
A concrete question because the above written question was not clear:
Suppose i have a paritytestmatrix =
$begin{bmatrix}
1 & alpha & alpha^2 & 1 & 0 \
1 &1 & 1& 0 &1 \
end{bmatrix}$
$alpha$ is a root of $x^2 + x + 1$. Now i know that $G = [I_k|P]$. How do i go in opposite direction? Inverse of a indentity matrix is same.
A little bit explaination would be enough.
matrices cryptography coding-theory
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
$endgroup$
How can i create a generator matrix for $(5,3)$ Linear block-code over $GF(2^2)$.
Most of the books mention the operations on this matrix and also that the choice of the basis vector is not unique that is the reason that a code can have different generator matrices. I know the rows of the matrix should be linearly independen but i don't understand how do i create generator matrix over a Galois field?
A concrete question because the above written question was not clear:
Suppose i have a paritytestmatrix =
$begin{bmatrix}
1 & alpha & alpha^2 & 1 & 0 \
1 &1 & 1& 0 &1 \
end{bmatrix}$
$alpha$ is a root of $x^2 + x + 1$. Now i know that $G = [I_k|P]$. How do i go in opposite direction? Inverse of a indentity matrix is same.
A little bit explaination would be enough.
matrices cryptography coding-theory
matrices cryptography coding-theory
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
edited Jan 26 at 2:17
Khan Saab
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
asked Jan 25 at 23:57
Khan SaabKhan Saab
1979
1979
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45
add a comment |
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
So you mean, how to find $G$ from a given $H$.
Recall that in general, if $G = [I_k|P]$ then $H=[-P^t | I_{n-k}]$ is a valid parity check matrix, because $G H^t=0$ (hence each row of $H$ is orthogonal to each row of $G$). And viceversa.
If the given matrix ($G$ or $H$) is not writen in the systematic way, then, we resort to the standard recipe of doing elementary row operations to put in that way (if this is not enough, we must permute columns and repermute them afterwards).
But here $H$ is systematic. So you just write
$$ -P^t=
begin{bmatrix}
1 & alpha & alpha^2 \
1 &1 & 1 \
end{bmatrix}$$
from that you get $P$ (remember that negation is performed in $GF(2^2)$ here) and you get $G$.
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3087752%2fcreating-the-generator-matrix-of-the-linear-block-code%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
So you mean, how to find $G$ from a given $H$.
Recall that in general, if $G = [I_k|P]$ then $H=[-P^t | I_{n-k}]$ is a valid parity check matrix, because $G H^t=0$ (hence each row of $H$ is orthogonal to each row of $G$). And viceversa.
If the given matrix ($G$ or $H$) is not writen in the systematic way, then, we resort to the standard recipe of doing elementary row operations to put in that way (if this is not enough, we must permute columns and repermute them afterwards).
But here $H$ is systematic. So you just write
$$ -P^t=
begin{bmatrix}
1 & alpha & alpha^2 \
1 &1 & 1 \
end{bmatrix}$$
from that you get $P$ (remember that negation is performed in $GF(2^2)$ here) and you get $G$.
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
$endgroup$
add a comment |
$begingroup$
So you mean, how to find $G$ from a given $H$.
Recall that in general, if $G = [I_k|P]$ then $H=[-P^t | I_{n-k}]$ is a valid parity check matrix, because $G H^t=0$ (hence each row of $H$ is orthogonal to each row of $G$). And viceversa.
If the given matrix ($G$ or $H$) is not writen in the systematic way, then, we resort to the standard recipe of doing elementary row operations to put in that way (if this is not enough, we must permute columns and repermute them afterwards).
But here $H$ is systematic. So you just write
$$ -P^t=
begin{bmatrix}
1 & alpha & alpha^2 \
1 &1 & 1 \
end{bmatrix}$$
from that you get $P$ (remember that negation is performed in $GF(2^2)$ here) and you get $G$.
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
$endgroup$
add a comment |
$begingroup$
So you mean, how to find $G$ from a given $H$.
Recall that in general, if $G = [I_k|P]$ then $H=[-P^t | I_{n-k}]$ is a valid parity check matrix, because $G H^t=0$ (hence each row of $H$ is orthogonal to each row of $G$). And viceversa.
If the given matrix ($G$ or $H$) is not writen in the systematic way, then, we resort to the standard recipe of doing elementary row operations to put in that way (if this is not enough, we must permute columns and repermute them afterwards).
But here $H$ is systematic. So you just write
$$ -P^t=
begin{bmatrix}
1 & alpha & alpha^2 \
1 &1 & 1 \
end{bmatrix}$$
from that you get $P$ (remember that negation is performed in $GF(2^2)$ here) and you get $G$.
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
$endgroup$
So you mean, how to find $G$ from a given $H$.
Recall that in general, if $G = [I_k|P]$ then $H=[-P^t | I_{n-k}]$ is a valid parity check matrix, because $G H^t=0$ (hence each row of $H$ is orthogonal to each row of $G$). And viceversa.
If the given matrix ($G$ or $H$) is not writen in the systematic way, then, we resort to the standard recipe of doing elementary row operations to put in that way (if this is not enough, we must permute columns and repermute them afterwards).
But here $H$ is systematic. So you just write
$$ -P^t=
begin{bmatrix}
1 & alpha & alpha^2 \
1 &1 & 1 \
end{bmatrix}$$
from that you get $P$ (remember that negation is performed in $GF(2^2)$ here) and you get $G$.
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
answered Jan 26 at 3:59
leonbloyleonbloy
41.5k647108
41.5k647108
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3087752%2fcreating-the-generator-matrix-of-the-linear-block-code%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Your question is not clear. There are many $(8,3)$ codes. You mean you are given a particular code and you want to find its $G$ (generator matrix)? Or just find some arbritrary $G$ ? In the latter case, just find any $3$ linearly indepedent binary tuples (rows, vectors)of length 8. Or you mean you don't understand when binary tuples are LI?
$endgroup$
– leonbloy
Jan 26 at 1:48
$begingroup$
@leonbloy i have added a concrete example. If you can explain, it would be great help.
$endgroup$
– Khan Saab
Jan 26 at 2:18
$begingroup$
Sorry, I had read $GF(2)$ :-)
$endgroup$
– leonbloy
Jan 26 at 3:45