On Reed Solomon Codes
I am trying to determine all possible values (parameters $n,k$) for which an RS-code exists over $GF(2^9)$. Using definition of RS-code, we know that $n|q-1$ and the designed distance $delta ge 2$ with $k=n+1- delta$. The divisors of $511$ include $7,73$ and $511$. When $n=7$, the values are $1le k le 6$ for $2 le delta le 7$. To be clear RS-Code $(7,6),(7,5),(7,4),(7,3),(7,2),(7,1)$ exists with distance $2,3,4,5,6,7$ respectively and the error correcting capabilities are $0,1,1,2,2,3$ respectively. The same procedure is performed for other divisors of $511$ which are $73$ and $511$. Does this look okay? or am I missing something? Is there an efficient/faster way to do this?
abstract-algebra coding-theory
asked Nov 29 at 7:53
Jaynot
487515
add a comment |
I am trying to determine all possible values (parameters $n,k$) for which an RS-code exists over $GF(2^9)$. Using definition of RS-code, we know that $n|q-1$ and the designed distance $delta ge 2$ with $k=n+1- delta$. The divisors of $511$ include $7,73$ and $511$. When $n=7$, the values are $1le k le 6$ for $2 le delta le 7$. To be clear RS-Code $(7,6),(7,5),(7,4),(7,3),(7,2),(7,1)$ exists with distance $2,3,4,5,6,7$ respectively and the error correcting capabilities are $0,1,1,2,2,3$ respectively. The same procedure is performed for other divisors of $511$ which are $73$ and $511$. Does this look okay? or am I missing something? Is there an efficient/faster way to do this?
abstract-algebra coding-theory
asked Nov 29 at 7:53
Jaynot
487515
add a comment |
I am trying to determine all possible values (parameters $n,k$) for which an RS-code exists over $GF(2^9)$. Using definition of RS-code, we know that $n|q-1$ and the designed distance $delta ge 2$ with $k=n+1- delta$. The divisors of $511$ include $7,73$ and $511$. When $n=7$, the values are $1le k le 6$ for $2 le delta le 7$. To be clear RS-Code $(7,6),(7,5),(7,4),(7,3),(7,2),(7,1)$ exists with distance $2,3,4,5,6,7$ respectively and the error correcting capabilities are $0,1,1,2,2,3$ respectively. The same procedure is performed for other divisors of $511$ which are $73$ and $511$. Does this look okay? or am I missing something? Is there an efficient/faster way to do this?
abstract-algebra coding-theory
asked Nov 29 at 7:53
Jaynot
487515
I am trying to determine all possible values (parameters $n,k$) for which an RS-code exists over $GF(2^9)$. Using definition of RS-code, we know that $n|q-1$ and the designed distance $delta ge 2$ with $k=n+1- delta$. The divisors of $511$ include $7,73$ and $511$. When $n=7$, the values are $1le k le 6$ for $2 le delta le 7$. To be clear RS-Code $(7,6),(7,5),(7,4),(7,3),(7,2),(7,1)$ exists with distance $2,3,4,5,6,7$ respectively and the error correcting capabilities are $0,1,1,2,2,3$ respectively. The same procedure is performed for other divisors of $511$ which are $73$ and $511$. Does this look okay? or am I missing something? Is there an efficient/faster way to do this?
abstract-algebra coding-theory
abstract-algebra coding-theory
asked Nov 29 at 7:53
Jaynot
487515
asked Nov 29 at 7:53
Jaynot
487515
edited Nov 30 at 2:34
asked Nov 29 at 7:53
Jaynot
487515
asked Nov 29 at 7:53
Jaynot
487515
asked Nov 29 at 7:53
Jaynot
487515
487515
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Your argument is correct. And since RS codes are MDS and obey $d_k=n-k+1,$ the parameter choices are as you state, and you obtain distance $d$ by choosing $d-1$ consecutive powers of an element $beta$ of order $n,$ as roots of the generating polynomial. The choice of where to start the string of consecutive powers may matter in terms of efficiency of implementation, as described in the answer to the question here :
It is not necessary for a Reed-Solomon code to be a narrow-sense BCH code. Indeed, the [255,223] "NASA standard" cyclic Reed-Solomon code over $mathbb{F}_{2^8}$ that was widely used many years ago (and still survives today in various other standards) is not a narrow-sense BCH code. One reason for that particular choice of b (and the choice of minimal polynomial of degree 8 whose root was β) was that it led to the fewest number of transistors in the decoder implementation in the hardware technology of the 1970s.
answered Nov 30 at 12:59
kodlu
3,380716
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%2f3018332%2fon-reed-solomon-codes%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
Your argument is correct. And since RS codes are MDS and obey $d_k=n-k+1,$ the parameter choices are as you state, and you obtain distance $d$ by choosing $d-1$ consecutive powers of an element $beta$ of order $n,$ as roots of the generating polynomial. The choice of where to start the string of consecutive powers may matter in terms of efficiency of implementation, as described in the answer to the question here :
It is not necessary for a Reed-Solomon code to be a narrow-sense BCH code. Indeed, the [255,223] "NASA standard" cyclic Reed-Solomon code over $mathbb{F}_{2^8}$ that was widely used many years ago (and still survives today in various other standards) is not a narrow-sense BCH code. One reason for that particular choice of b (and the choice of minimal polynomial of degree 8 whose root was β) was that it led to the fewest number of transistors in the decoder implementation in the hardware technology of the 1970s.
answered Nov 30 at 12:59
kodlu
3,380716
add a comment |
Your argument is correct. And since RS codes are MDS and obey $d_k=n-k+1,$ the parameter choices are as you state, and you obtain distance $d$ by choosing $d-1$ consecutive powers of an element $beta$ of order $n,$ as roots of the generating polynomial. The choice of where to start the string of consecutive powers may matter in terms of efficiency of implementation, as described in the answer to the question here :
It is not necessary for a Reed-Solomon code to be a narrow-sense BCH code. Indeed, the [255,223] "NASA standard" cyclic Reed-Solomon code over $mathbb{F}_{2^8}$ that was widely used many years ago (and still survives today in various other standards) is not a narrow-sense BCH code. One reason for that particular choice of b (and the choice of minimal polynomial of degree 8 whose root was β) was that it led to the fewest number of transistors in the decoder implementation in the hardware technology of the 1970s.
answered Nov 30 at 12:59
kodlu
3,380716
add a comment |
Your argument is correct. And since RS codes are MDS and obey $d_k=n-k+1,$ the parameter choices are as you state, and you obtain distance $d$ by choosing $d-1$ consecutive powers of an element $beta$ of order $n,$ as roots of the generating polynomial. The choice of where to start the string of consecutive powers may matter in terms of efficiency of implementation, as described in the answer to the question here :
It is not necessary for a Reed-Solomon code to be a narrow-sense BCH code. Indeed, the [255,223] "NASA standard" cyclic Reed-Solomon code over $mathbb{F}_{2^8}$ that was widely used many years ago (and still survives today in various other standards) is not a narrow-sense BCH code. One reason for that particular choice of b (and the choice of minimal polynomial of degree 8 whose root was β) was that it led to the fewest number of transistors in the decoder implementation in the hardware technology of the 1970s.
answered Nov 30 at 12:59
kodlu
3,380716
Your argument is correct. And since RS codes are MDS and obey $d_k=n-k+1,$ the parameter choices are as you state, and you obtain distance $d$ by choosing $d-1$ consecutive powers of an element $beta$ of order $n,$ as roots of the generating polynomial. The choice of where to start the string of consecutive powers may matter in terms of efficiency of implementation, as described in the answer to the question here :
It is not necessary for a Reed-Solomon code to be a narrow-sense BCH code. Indeed, the [255,223] "NASA standard" cyclic Reed-Solomon code over $mathbb{F}_{2^8}$ that was widely used many years ago (and still survives today in various other standards) is not a narrow-sense BCH code. One reason for that particular choice of b (and the choice of minimal polynomial of degree 8 whose root was β) was that it led to the fewest number of transistors in the decoder implementation in the hardware technology of the 1970s.
answered Nov 30 at 12:59
kodlu
3,380716
answered Nov 30 at 12:59
kodlu
3,380716
answered Nov 30 at 12:59
kodlu
3,380716
answered Nov 30 at 12:59
kodlu
3,380716
3,380716
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3018332%2fon-reed-solomon-codes%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
