Comparison of two Huffman codes:
A set of eight messages with probabilities of $0.2$, $0.15$, $0.15$, $0.1$, $0.1$, $0.1$, $0.1$, and $0.1$ are encoded into a ternary Huffman code.
One set of Huffman codewords are {$2, 01, 02, 10, 11, 12, 000, 001$} with the average length of the codeword(L) = $2$.
Another set of Huffman codewords are {$00, 01, 02, 10, 11, 12, 20, 21$} also with the average length of the codeword(L) = $2$.
I want to know which set of codewords is better. And if its dependent on the application, please provide some examples.
information-theory coding-theory
add a comment |
A set of eight messages with probabilities of $0.2$, $0.15$, $0.15$, $0.1$, $0.1$, $0.1$, $0.1$, and $0.1$ are encoded into a ternary Huffman code.
One set of Huffman codewords are {$2, 01, 02, 10, 11, 12, 000, 001$} with the average length of the codeword(L) = $2$.
Another set of Huffman codewords are {$00, 01, 02, 10, 11, 12, 20, 21$} also with the average length of the codeword(L) = $2$.
I want to know which set of codewords is better. And if its dependent on the application, please provide some examples.
information-theory coding-theory
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03
add a comment |
A set of eight messages with probabilities of $0.2$, $0.15$, $0.15$, $0.1$, $0.1$, $0.1$, $0.1$, and $0.1$ are encoded into a ternary Huffman code.
One set of Huffman codewords are {$2, 01, 02, 10, 11, 12, 000, 001$} with the average length of the codeword(L) = $2$.
Another set of Huffman codewords are {$00, 01, 02, 10, 11, 12, 20, 21$} also with the average length of the codeword(L) = $2$.
I want to know which set of codewords is better. And if its dependent on the application, please provide some examples.
information-theory coding-theory
A set of eight messages with probabilities of $0.2$, $0.15$, $0.15$, $0.1$, $0.1$, $0.1$, $0.1$, and $0.1$ are encoded into a ternary Huffman code.
One set of Huffman codewords are {$2, 01, 02, 10, 11, 12, 000, 001$} with the average length of the codeword(L) = $2$.
Another set of Huffman codewords are {$00, 01, 02, 10, 11, 12, 20, 21$} also with the average length of the codeword(L) = $2$.
I want to know which set of codewords is better. And if its dependent on the application, please provide some examples.
information-theory coding-theory
information-theory coding-theory
asked Nov 20 at 4:47
Narendra Deconda
504112
504112
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03
add a comment |
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03
add a comment |
active
oldest
votes
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%2f3005947%2fcomparison-of-two-huffman-codes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3005947%2fcomparison-of-two-huffman-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
"I want to know which set of codewords is better" You want to think which code is better. It's mere common sense.
– leonbloy
Nov 20 at 18:09
I know the fixed length code is better in the decoding process. But I want to know whether this the correct reason or are there any other applications where the first one is used.
– Narendra Deconda
Nov 21 at 3:03