Equivalence of codes defines a symmetric relationBinary codes behaving differently from other codes?Knuth equivalence of unshufflesCycles “converging” to an infinite cycle?Permutation that gives a sequence of non-negative partial sumsBlocks in permutation group theory (D&F)Factorizations in the symmetric groupHow do I form a group of permutations and determine the multiplication table for the group?Generator polynomial of the sum of cyclic codesNumber of deranged indicesAn algorithm on $S_n$. What is the final permutation?
I2C signal and power over long range (10meter cable)
In Star Trek IV, why did the Bounty go back to a time when whales were already rare?
I'm in charge of equipment buying but no one's ever happy with what I choose. How to fix this?
Is it legal to discriminate due to the medicine used to treat a medical condition?
A social experiment. What is the worst that can happen?
Hostile work environment after whistle-blowing on coworker and our boss. What do I do?
Is infinity mathematically observable?
Why isn't KTEX's runway designation 10/28 instead of 9/27?
Indicating multiple different modes of speech (fantasy language or telepathy)
What is the term when two people sing in harmony, but they aren't singing the same notes?
Would it be legal for a US State to ban exports of a natural resource?
Invariance of results when scaling explanatory variables in logistic regression, is there a proof?
Can I use my Chinese passport to enter China after I acquired another citizenship?
Why is delta-v is the most useful quantity for planning space travel?
Is there a problem with hiding "forgot password" until it's needed?
What is Sitecore Managed Cloud?
How can I raise concerns with a new DM about XP splitting?
How did Monica know how to operate Carol's "designer"?
For airliners, what prevents wing strikes on landing in bad weather?
Why does this part of the Space Shuttle launch pad seem to be floating in air?
Is it possible to build a CPA Secure encryption scheme which remains secure even when the encryption of secret key is given?
The most efficient algorithm to find all possible integer pairs which sum to a given integer
Is there enough fresh water in the world to eradicate the drinking water crisis?
Simulating a probability of 1 of 2^N with less than N random bits
Equivalence of codes defines a symmetric relation
Binary codes behaving differently from other codes?Knuth equivalence of unshufflesCycles “converging” to an infinite cycle?Permutation that gives a sequence of non-negative partial sumsBlocks in permutation group theory (D&F)Factorizations in the symmetric groupHow do I form a group of permutations and determine the multiplication table for the group?Generator polynomial of the sum of cyclic codesNumber of deranged indicesAn algorithm on $S_n$. What is the final permutation?
$begingroup$
Two codes $C_1, C_2 subseteq A^n$ are called equivalent (notation: $sim$) if there are permutations $pi in Sym(A)$ and $sigma_1, dots, sigma_n in S_n$ such that
$$C_2 = (sigma_1(a_pi(1)), dots, sigma_n(a_pi(n))) mid (a_1, dots, a_n ) in C_1$$
Intuitively, this means that we can permute the order of the symbols in our code words, and subsequently permute the alphabet $A$ on every single position on everyy word.
The text I'm reading mentions without proof that $sim$ defines an equivalence relation, but I do not succeed in proving this.
In particular, I'm stuck at showing that
$$C_1 sim C_2 implies C_2 sim C_1$$
I tried with a little example:
if we have the code $C_1 := 00000,01101,10110,11011 subseteq 0,1^5$ and we perform $pi = (12)(345)$ and $sigma_3 = sigma_4 = 1$, $sigma_1 = sigma_2 = sigma_5 neq 1$, then we get the code $C_2 = 11001,01111,10010,00100$
To get back to $C_1$, we have to apply $pi' = (21543)$ and $sigma_2' = sigma_3' = 1$ and $sigma_1' = sigma_4' = sigma_5' neq 1$. I don't see a relation between the permutations $pi, sigma_i$ and $pi', sigma_j$ that can help me.
How can I show that this relation is symmetric?
permutations equivalence-relations coding-theory
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
$endgroup$
add a comment |
$begingroup$
Two codes $C_1, C_2 subseteq A^n$ are called equivalent (notation: $sim$) if there are permutations $pi in Sym(A)$ and $sigma_1, dots, sigma_n in S_n$ such that
$$C_2 = (sigma_1(a_pi(1)), dots, sigma_n(a_pi(n))) mid (a_1, dots, a_n ) in C_1$$
Intuitively, this means that we can permute the order of the symbols in our code words, and subsequently permute the alphabet $A$ on every single position on everyy word.
The text I'm reading mentions without proof that $sim$ defines an equivalence relation, but I do not succeed in proving this.
In particular, I'm stuck at showing that
$$C_1 sim C_2 implies C_2 sim C_1$$
I tried with a little example:
if we have the code $C_1 := 00000,01101,10110,11011 subseteq 0,1^5$ and we perform $pi = (12)(345)$ and $sigma_3 = sigma_4 = 1$, $sigma_1 = sigma_2 = sigma_5 neq 1$, then we get the code $C_2 = 11001,01111,10010,00100$
To get back to $C_1$, we have to apply $pi' = (21543)$ and $sigma_2' = sigma_3' = 1$ and $sigma_1' = sigma_4' = sigma_5' neq 1$. I don't see a relation between the permutations $pi, sigma_i$ and $pi', sigma_j$ that can help me.
How can I show that this relation is symmetric?
permutations equivalence-relations coding-theory
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
$endgroup$
add a comment |
$begingroup$
Two codes $C_1, C_2 subseteq A^n$ are called equivalent (notation: $sim$) if there are permutations $pi in Sym(A)$ and $sigma_1, dots, sigma_n in S_n$ such that
$$C_2 = (sigma_1(a_pi(1)), dots, sigma_n(a_pi(n))) mid (a_1, dots, a_n ) in C_1$$
Intuitively, this means that we can permute the order of the symbols in our code words, and subsequently permute the alphabet $A$ on every single position on everyy word.
The text I'm reading mentions without proof that $sim$ defines an equivalence relation, but I do not succeed in proving this.
In particular, I'm stuck at showing that
$$C_1 sim C_2 implies C_2 sim C_1$$
I tried with a little example:
if we have the code $C_1 := 00000,01101,10110,11011 subseteq 0,1^5$ and we perform $pi = (12)(345)$ and $sigma_3 = sigma_4 = 1$, $sigma_1 = sigma_2 = sigma_5 neq 1$, then we get the code $C_2 = 11001,01111,10010,00100$
To get back to $C_1$, we have to apply $pi' = (21543)$ and $sigma_2' = sigma_3' = 1$ and $sigma_1' = sigma_4' = sigma_5' neq 1$. I don't see a relation between the permutations $pi, sigma_i$ and $pi', sigma_j$ that can help me.
How can I show that this relation is symmetric?
permutations equivalence-relations coding-theory
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
$endgroup$
Two codes $C_1, C_2 subseteq A^n$ are called equivalent (notation: $sim$) if there are permutations $pi in Sym(A)$ and $sigma_1, dots, sigma_n in S_n$ such that
$$C_2 = (sigma_1(a_pi(1)), dots, sigma_n(a_pi(n))) mid (a_1, dots, a_n ) in C_1$$
Intuitively, this means that we can permute the order of the symbols in our code words, and subsequently permute the alphabet $A$ on every single position on everyy word.
The text I'm reading mentions without proof that $sim$ defines an equivalence relation, but I do not succeed in proving this.
In particular, I'm stuck at showing that
$$C_1 sim C_2 implies C_2 sim C_1$$
I tried with a little example:
if we have the code $C_1 := 00000,01101,10110,11011 subseteq 0,1^5$ and we perform $pi = (12)(345)$ and $sigma_3 = sigma_4 = 1$, $sigma_1 = sigma_2 = sigma_5 neq 1$, then we get the code $C_2 = 11001,01111,10010,00100$
To get back to $C_1$, we have to apply $pi' = (21543)$ and $sigma_2' = sigma_3' = 1$ and $sigma_1' = sigma_4' = sigma_5' neq 1$. I don't see a relation between the permutations $pi, sigma_i$ and $pi', sigma_j$ that can help me.
How can I show that this relation is symmetric?
permutations equivalence-relations coding-theory
permutations equivalence-relations coding-theory
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
edited Mar 16 at 20:07
Math_QED
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
asked Mar 16 at 19:58
Math_QEDMath_QED
7,71131454
7,71131454
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Answering my own question:
It is easy to check that (show that the right side is contained in the left side and then use that both sides have equal finite order)
$$C_1 = (sigma^-1_pi^-1(1)(a_pi^-1(1))), dots, (sigma^-1_pi^-1(a_pi^-1(n)))mid (a_1, dots, a_n) in C_2$$
and the symmetry follows.
answered 9 hours ago
Math_QEDMath_QED
7,71131454
$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%2f3150779%2fequivalence-of-codes-defines-a-symmetric-relation%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$
Answering my own question:
It is easy to check that (show that the right side is contained in the left side and then use that both sides have equal finite order)
$$C_1 = (sigma^-1_pi^-1(1)(a_pi^-1(1))), dots, (sigma^-1_pi^-1(a_pi^-1(n)))mid (a_1, dots, a_n) in C_2$$
and the symmetry follows.
answered 9 hours ago
Math_QEDMath_QED
7,71131454
$endgroup$
add a comment |
$begingroup$
Answering my own question:
It is easy to check that (show that the right side is contained in the left side and then use that both sides have equal finite order)
$$C_1 = (sigma^-1_pi^-1(1)(a_pi^-1(1))), dots, (sigma^-1_pi^-1(a_pi^-1(n)))mid (a_1, dots, a_n) in C_2$$
and the symmetry follows.
answered 9 hours ago
Math_QEDMath_QED
7,71131454
$endgroup$
add a comment |
$begingroup$
Answering my own question:
It is easy to check that (show that the right side is contained in the left side and then use that both sides have equal finite order)
$$C_1 = (sigma^-1_pi^-1(1)(a_pi^-1(1))), dots, (sigma^-1_pi^-1(a_pi^-1(n)))mid (a_1, dots, a_n) in C_2$$
and the symmetry follows.
answered 9 hours ago
Math_QEDMath_QED
7,71131454
$endgroup$
Answering my own question:
It is easy to check that (show that the right side is contained in the left side and then use that both sides have equal finite order)
$$C_1 = (sigma^-1_pi^-1(1)(a_pi^-1(1))), dots, (sigma^-1_pi^-1(a_pi^-1(n)))mid (a_1, dots, a_n) in C_2$$
and the symmetry follows.
answered 9 hours ago
Math_QEDMath_QED
7,71131454
answered 9 hours ago
Math_QEDMath_QED
7,71131454
answered 9 hours ago
Math_QEDMath_QED
7,71131454
answered 9 hours ago
Math_QEDMath_QED
7,71131454
7,71131454
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%2f3150779%2fequivalence-of-codes-defines-a-symmetric-relation%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
