Redis: Computing Hamming Distance
Is it possible, using Redis commands, to compute the hamming distance between two entries in {0, 1}^n, s.a., https://redis.io/commands/bitfield?
redis
asked Nov 20 '18 at 23:24
andrew231andrew231
717
add a comment |
Is it possible, using Redis commands, to compute the hamming distance between two entries in {0, 1}^n, s.a., https://redis.io/commands/bitfield?
redis
asked Nov 20 '18 at 23:24
andrew231andrew231
717
add a comment |
Is it possible, using Redis commands, to compute the hamming distance between two entries in {0, 1}^n, s.a., https://redis.io/commands/bitfield?
redis
asked Nov 20 '18 at 23:24
andrew231andrew231
717
Is it possible, using Redis commands, to compute the hamming distance between two entries in {0, 1}^n, s.a., https://redis.io/commands/bitfield?
redis
redis
asked Nov 20 '18 at 23:24
andrew231andrew231
717
asked Nov 20 '18 at 23:24
andrew231andrew231
717
asked Nov 20 '18 at 23:24
andrew231andrew231
717
asked Nov 20 '18 at 23:24
andrew231andrew231
717
asked Nov 20 '18 at 23:24
andrew231andrew231
717
717
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Yes, you can do that with BITOP and BITCOUNT commands.
In order to calculate the Hamming Distance, you can XOR two given entries, and count the number of 1s in the result.
// The first entry: 10000001
SETBIT k1 0 1
SETBIT k1 7 1
// The second entry: 00000010
SETBIT k2 6 1
// first entry XOR second entry: 10000011
BITOP XOR result k1 k2
// count the number of 1s in the result, i.e. the Hamming Distance between the two entries: 3
BITCOUNT result
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
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%2fstackoverflow.com%2fquestions%2f53403130%2fredis-computing-hamming-distance%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
Yes, you can do that with BITOP and BITCOUNT commands.
In order to calculate the Hamming Distance, you can XOR two given entries, and count the number of 1s in the result.
// The first entry: 10000001
SETBIT k1 0 1
SETBIT k1 7 1
// The second entry: 00000010
SETBIT k2 6 1
// first entry XOR second entry: 10000011
BITOP XOR result k1 k2
// count the number of 1s in the result, i.e. the Hamming Distance between the two entries: 3
BITCOUNT result
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
add a comment |
Yes, you can do that with BITOP and BITCOUNT commands.
In order to calculate the Hamming Distance, you can XOR two given entries, and count the number of 1s in the result.
// The first entry: 10000001
SETBIT k1 0 1
SETBIT k1 7 1
// The second entry: 00000010
SETBIT k2 6 1
// first entry XOR second entry: 10000011
BITOP XOR result k1 k2
// count the number of 1s in the result, i.e. the Hamming Distance between the two entries: 3
BITCOUNT result
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
add a comment |
Yes, you can do that with BITOP and BITCOUNT commands.
In order to calculate the Hamming Distance, you can XOR two given entries, and count the number of 1s in the result.
// The first entry: 10000001
SETBIT k1 0 1
SETBIT k1 7 1
// The second entry: 00000010
SETBIT k2 6 1
// first entry XOR second entry: 10000011
BITOP XOR result k1 k2
// count the number of 1s in the result, i.e. the Hamming Distance between the two entries: 3
BITCOUNT result
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
Yes, you can do that with BITOP and BITCOUNT commands.
In order to calculate the Hamming Distance, you can XOR two given entries, and count the number of 1s in the result.
// The first entry: 10000001
SETBIT k1 0 1
SETBIT k1 7 1
// The second entry: 00000010
SETBIT k2 6 1
// first entry XOR second entry: 10000011
BITOP XOR result k1 k2
// count the number of 1s in the result, i.e. the Hamming Distance between the two entries: 3
BITCOUNT result
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
answered Nov 21 '18 at 1:54
for_stackfor_stack
7,6542722
7,6542722
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- 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%2fstackoverflow.com%2fquestions%2f53403130%2fredis-computing-hamming-distance%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
