Mixing
Matrices with nearly balanced matches and mismatches between columns
$begingroup$
I am interested in binary matrices with a near balanced number of matched and mismatched entries between columns. For example, a Hadamard matrix has a perfect balance between matched and mismatched entries between columns:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
1 0 0 1
end{bmatrix}
Concretely, we see that $[1 1 1 1]$ and $[1 0 1 0]$ match in the first and third and entries and mismatch in the second and fourth entries.
However, we can also construct matrices that have nearly balanced matched and mismatched entries. For example, by deleting the last row of the above we obtain a matrix where the number of matched and mismatched entries between two columns are different by at most one:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
end{bmatrix}
Concretely, we see that $[1 1 1]$ and $[1 0 1]$ match in the first and third entry and are mismatched in the second entry. The number of matches and mismatches differs by one.
Note that this is different than the concept behind error correcting codes, where we try and maximize the minimum number of mismatches between any two columns.
What are these objects with nearly balanced matched and mismatched columns called? If I want to learn more about them, what kind of topics will be relevant?
combinatorics reference-request hadamard-matrices
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
$endgroup$
add a comment |
$begingroup$
I am interested in binary matrices with a near balanced number of matched and mismatched entries between columns. For example, a Hadamard matrix has a perfect balance between matched and mismatched entries between columns:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
1 0 0 1
end{bmatrix}
Concretely, we see that $[1 1 1 1]$ and $[1 0 1 0]$ match in the first and third and entries and mismatch in the second and fourth entries.
However, we can also construct matrices that have nearly balanced matched and mismatched entries. For example, by deleting the last row of the above we obtain a matrix where the number of matched and mismatched entries between two columns are different by at most one:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
end{bmatrix}
Concretely, we see that $[1 1 1]$ and $[1 0 1]$ match in the first and third entry and are mismatched in the second entry. The number of matches and mismatches differs by one.
Note that this is different than the concept behind error correcting codes, where we try and maximize the minimum number of mismatches between any two columns.
What are these objects with nearly balanced matched and mismatched columns called? If I want to learn more about them, what kind of topics will be relevant?
combinatorics reference-request hadamard-matrices
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
$endgroup$
add a comment |
$begingroup$
I am interested in binary matrices with a near balanced number of matched and mismatched entries between columns. For example, a Hadamard matrix has a perfect balance between matched and mismatched entries between columns:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
1 0 0 1
end{bmatrix}
Concretely, we see that $[1 1 1 1]$ and $[1 0 1 0]$ match in the first and third and entries and mismatch in the second and fourth entries.
However, we can also construct matrices that have nearly balanced matched and mismatched entries. For example, by deleting the last row of the above we obtain a matrix where the number of matched and mismatched entries between two columns are different by at most one:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
end{bmatrix}
Concretely, we see that $[1 1 1]$ and $[1 0 1]$ match in the first and third entry and are mismatched in the second entry. The number of matches and mismatches differs by one.
Note that this is different than the concept behind error correcting codes, where we try and maximize the minimum number of mismatches between any two columns.
What are these objects with nearly balanced matched and mismatched columns called? If I want to learn more about them, what kind of topics will be relevant?
combinatorics reference-request hadamard-matrices
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
$endgroup$
I am interested in binary matrices with a near balanced number of matched and mismatched entries between columns. For example, a Hadamard matrix has a perfect balance between matched and mismatched entries between columns:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
1 0 0 1
end{bmatrix}
Concretely, we see that $[1 1 1 1]$ and $[1 0 1 0]$ match in the first and third and entries and mismatch in the second and fourth entries.
However, we can also construct matrices that have nearly balanced matched and mismatched entries. For example, by deleting the last row of the above we obtain a matrix where the number of matched and mismatched entries between two columns are different by at most one:
begin{bmatrix}
1 1 1 1 \
1 0 1 0\
1 1 0 0\
end{bmatrix}
Concretely, we see that $[1 1 1]$ and $[1 0 1]$ match in the first and third entry and are mismatched in the second entry. The number of matches and mismatches differs by one.
Note that this is different than the concept behind error correcting codes, where we try and maximize the minimum number of mismatches between any two columns.
What are these objects with nearly balanced matched and mismatched columns called? If I want to learn more about them, what kind of topics will be relevant?
combinatorics reference-request hadamard-matrices
combinatorics reference-request hadamard-matrices
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
asked Jan 10 at 18:16
David EgolfDavid Egolf
747
747
add a comment |
add a comment |
0
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%2f3068996%2fmatrices-with-nearly-balanced-matches-and-mismatches-between-columns%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3068996%2fmatrices-with-nearly-balanced-matches-and-mismatches-between-columns%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
