Does a code with length 6, size 32 and distance 2 exist?












2












$begingroup$


The problem is to prove or disprove the existence of $C$, s.t., $|c| = 6,forall cin C$; $|C| = 32$; $d(c_i,c_j)geq2,1leq i<jleq32$. ($d$ stands for hamming distance)



I tried to construct a satisfying code. The best I can get is to let $C = C'times C'$, a concatenation of $C' = {000,011,110,101}$, which is of size 16. 32 happens to be the theoretical upper bound of the size, now I don't know what to do next so as to solve the problem.






information-theory coding-theory encoding-scheme







share|cite|improve this question









$endgroup$

















    2












    $begingroup$


    The problem is to prove or disprove the existence of $C$, s.t., $|c| = 6,forall cin C$; $|C| = 32$; $d(c_i,c_j)geq2,1leq i<jleq32$. ($d$ stands for hamming distance)



    I tried to construct a satisfying code. The best I can get is to let $C = C'times C'$, a concatenation of $C' = {000,011,110,101}$, which is of size 16. 32 happens to be the theoretical upper bound of the size, now I don't know what to do next so as to solve the problem.






    information-theory coding-theory encoding-scheme







    share|cite|improve this question









    $endgroup$















      2












      2








      2





      $begingroup$


      The problem is to prove or disprove the existence of $C$, s.t., $|c| = 6,forall cin C$; $|C| = 32$; $d(c_i,c_j)geq2,1leq i<jleq32$. ($d$ stands for hamming distance)



      I tried to construct a satisfying code. The best I can get is to let $C = C'times C'$, a concatenation of $C' = {000,011,110,101}$, which is of size 16. 32 happens to be the theoretical upper bound of the size, now I don't know what to do next so as to solve the problem.






      information-theory coding-theory encoding-scheme







      share|cite|improve this question









      $endgroup$




      The problem is to prove or disprove the existence of $C$, s.t., $|c| = 6,forall cin C$; $|C| = 32$; $d(c_i,c_j)geq2,1leq i<jleq32$. ($d$ stands for hamming distance)



      I tried to construct a satisfying code. The best I can get is to let $C = C'times C'$, a concatenation of $C' = {000,011,110,101}$, which is of size 16. 32 happens to be the theoretical upper bound of the size, now I don't know what to do next so as to solve the problem.






      information-theory coding-theory encoding-scheme




      information-theory coding-theory encoding-scheme






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 2 hours ago









      MianguMiangu

      614




      614






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          All words of even parity from a linear code with $2^{n-1}$ codewords and minimum distance $2$.



          More generally, if $A_2(n,d)$ is the maximum size of a code of length $n$ and minimum distance $d$, then $A_2(n,2d) = A_2(n-1,2d-1)$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
            $endgroup$
            – Apass.Jack
            29 mins ago












          • $begingroup$
            The subscript signifies the field $mathbb{F}_2$.
            $endgroup$
            – Yuval Filmus
            28 mins ago



















          2












          $begingroup$

          Yes, there is such a set. You are actually on the right track to find the following example.



          Let $C = {c : |c|=6 text{ and there are even number of 1's in c}}$. You can check the following.





          • $|C|=32$.


          • $d(u,v)geq2$ for all $u,vin C$, $unot=v$. (In fact, $d(u,v)=2$ or 4.)



          Here are two related exercise.



          Exercise 1. Give another example of a set of 32 words of length 6 and pairwise distance at least 2.



          Exercise 2. Show that there are only two such sets, as given in the answer and in the exercise 1.



          Exercise 3. Generalize the above to words of any given length.










          share|cite|improve this answer











          $endgroup$













            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: "419"
            };
            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: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            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
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f104581%2fdoes-a-code-with-length-6-size-32-and-distance-2-exist%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            All words of even parity from a linear code with $2^{n-1}$ codewords and minimum distance $2$.



            More generally, if $A_2(n,d)$ is the maximum size of a code of length $n$ and minimum distance $d$, then $A_2(n,2d) = A_2(n-1,2d-1)$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
              $endgroup$
              – Apass.Jack
              29 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              28 mins ago
















            2












            $begingroup$

            All words of even parity from a linear code with $2^{n-1}$ codewords and minimum distance $2$.



            More generally, if $A_2(n,d)$ is the maximum size of a code of length $n$ and minimum distance $d$, then $A_2(n,2d) = A_2(n-1,2d-1)$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
              $endgroup$
              – Apass.Jack
              29 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              28 mins ago














            2












            2








            2





            $begingroup$

            All words of even parity from a linear code with $2^{n-1}$ codewords and minimum distance $2$.



            More generally, if $A_2(n,d)$ is the maximum size of a code of length $n$ and minimum distance $d$, then $A_2(n,2d) = A_2(n-1,2d-1)$.






            share|cite|improve this answer









            $endgroup$



            All words of even parity from a linear code with $2^{n-1}$ codewords and minimum distance $2$.



            More generally, if $A_2(n,d)$ is the maximum size of a code of length $n$ and minimum distance $d$, then $A_2(n,2d) = A_2(n-1,2d-1)$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 1 hour ago









            Yuval FilmusYuval Filmus

            192k14180344




            192k14180344












            • $begingroup$
              Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
              $endgroup$
              – Apass.Jack
              29 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              28 mins ago


















            • $begingroup$
              Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
              $endgroup$
              – Apass.Jack
              29 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              28 mins ago
















            $begingroup$
            Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
            $endgroup$
            – Apass.Jack
            29 mins ago






            $begingroup$
            Nice fact, upvoted. By the way, why not just $A(n,d)$ instead of $A_2(n,d)$? Oh, two letters.
            $endgroup$
            – Apass.Jack
            29 mins ago














            $begingroup$
            The subscript signifies the field $mathbb{F}_2$.
            $endgroup$
            – Yuval Filmus
            28 mins ago




            $begingroup$
            The subscript signifies the field $mathbb{F}_2$.
            $endgroup$
            – Yuval Filmus
            28 mins ago











            2












            $begingroup$

            Yes, there is such a set. You are actually on the right track to find the following example.



            Let $C = {c : |c|=6 text{ and there are even number of 1's in c}}$. You can check the following.





            • $|C|=32$.


            • $d(u,v)geq2$ for all $u,vin C$, $unot=v$. (In fact, $d(u,v)=2$ or 4.)



            Here are two related exercise.



            Exercise 1. Give another example of a set of 32 words of length 6 and pairwise distance at least 2.



            Exercise 2. Show that there are only two such sets, as given in the answer and in the exercise 1.



            Exercise 3. Generalize the above to words of any given length.










            share|cite|improve this answer











            $endgroup$


















              2












              $begingroup$

              Yes, there is such a set. You are actually on the right track to find the following example.



              Let $C = {c : |c|=6 text{ and there are even number of 1's in c}}$. You can check the following.





              • $|C|=32$.


              • $d(u,v)geq2$ for all $u,vin C$, $unot=v$. (In fact, $d(u,v)=2$ or 4.)



              Here are two related exercise.



              Exercise 1. Give another example of a set of 32 words of length 6 and pairwise distance at least 2.



              Exercise 2. Show that there are only two such sets, as given in the answer and in the exercise 1.



              Exercise 3. Generalize the above to words of any given length.










              share|cite|improve this answer











              $endgroup$
















                2












                2








                2





                $begingroup$

                Yes, there is such a set. You are actually on the right track to find the following example.



                Let $C = {c : |c|=6 text{ and there are even number of 1's in c}}$. You can check the following.





                • $|C|=32$.


                • $d(u,v)geq2$ for all $u,vin C$, $unot=v$. (In fact, $d(u,v)=2$ or 4.)



                Here are two related exercise.



                Exercise 1. Give another example of a set of 32 words of length 6 and pairwise distance at least 2.



                Exercise 2. Show that there are only two such sets, as given in the answer and in the exercise 1.



                Exercise 3. Generalize the above to words of any given length.










                share|cite|improve this answer











                $endgroup$



                Yes, there is such a set. You are actually on the right track to find the following example.



                Let $C = {c : |c|=6 text{ and there are even number of 1's in c}}$. You can check the following.





                • $|C|=32$.


                • $d(u,v)geq2$ for all $u,vin C$, $unot=v$. (In fact, $d(u,v)=2$ or 4.)



                Here are two related exercise.



                Exercise 1. Give another example of a set of 32 words of length 6 and pairwise distance at least 2.



                Exercise 2. Show that there are only two such sets, as given in the answer and in the exercise 1.



                Exercise 3. Generalize the above to words of any given length.











                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited 40 mins ago

























                answered 1 hour ago









                Apass.JackApass.Jack

                11k1939




                11k1939






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Computer Science 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.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f104581%2fdoes-a-code-with-length-6-size-32-and-distance-2-exist%23new-answer', 'question_page');
                    }
                    );

                    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







                    -

                    Popular posts from this blog

                    404 Error Contact Form 7 ajax form submitting

                    Image
                    0 The contact form does not work, and affects loading after one try. The chrome console shows the error message: POST http://example.com/wp-json/contact-form-7/v1/contact-forms/50/feedback 404 (Not Found) send @ jquery.js?ver=1.12.4:4 ajax @ jquery.js?ver=1.12.4:4 wpcf7.submit @ scripts.js?ver=5.0.3:346 (anonymous) @ scripts.js?ver=5.0.3:53 dispatch @ jquery.js?ver=1.12.4:3 r.handle @ jquery.js?ver=1.12.4:3 How to solve this issue? thanks in advance javascript wordpress contact-form-7 share | improve this question edited Jul 17 '18 at 5:39 Kiran Shahi 4,745 3 16 43 ...
                    Read more

                    How to know if a Active Directory user can login interactively

                    Image
                    1 I would like to know if and how is it possible to know if a AD user can login interactively (on a server) in a domain. I need to know if I can find it out using a LDAP search. Thanks. windows active-directory login user-permissions user-profile share | improve this question edited 1 hour ago yagmoth555 ♦ 11.6k 3 17 42 asked 1 hour ago Luigi Luigi 6 1 New contributor ...
                    Read more

                    Refactoring coordinates for Minecraft Pi buildings written in Python

                    Image
                    0 $begingroup$ I'm fairly new to coding and I wrote this script in Python for a house with a roof in Minecraft Pi. I've found different ways to write the coordinates to make the code base shorter, but I'm wondering if it is possible for me to refactor it any further so I don't have to list each coordinate line by line. import mcpi.minecraft as minecraft import mcpi.block as block mc = minecraft.Minecraft.create() p = mc.player.getTilePos() mc.setBlocks(p.x+1, p.y, p.z+1, #Main structure starting coordinates (DO NOT ALTER) p.x+19, p.y+4, p.z+6, #Structure size/coordinates (Alters cube size) block.STONE_BRICK) mc.setBlocks(p.x+2, p.y+1, p.z+2, #Hollowing out main structure interior p.x+18, p.y+3, p.z+5, block.AIR) mc.setBlocks(p.x, p.y...
                    Read more