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 3 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
            40 mins ago












          • $begingroup$
            The subscript signifies the field $mathbb{F}_2$.
            $endgroup$
            – Yuval Filmus
            40 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
              40 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              40 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
              40 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              40 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
              40 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              40 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
              40 mins ago












            • $begingroup$
              The subscript signifies the field $mathbb{F}_2$.
              $endgroup$
              – Yuval Filmus
              40 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
            40 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
            40 mins ago














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




            $begingroup$
            The subscript signifies the field $mathbb{F}_2$.
            $endgroup$
            – Yuval Filmus
            40 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 51 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

                    Loup dans la culture

                    Image
                    Loups sur une enluminure du Bestiaire d'Aberdeen Le loup est l'animal le plus emblématique de l'histoire de l'Eurasie, il était à l'honneur durant l'Antiquité chez la totalité des anciens peuples européens [ 1 ] . Sommaire 1 Le loup dans la mythologie 2 Les loups dans le folklore 2.1 L'évolution des mentalités 2.2 Le loup dans la psychanalyse 3 Le loup dans les œuvres culturelles 3.1 Le loup dans la littérature 3.1.1 Fables 3.1.2 Poésie 3.1.3 Romans 3.1.4 Littérature jeunesse 3.1.4.1 Quelques titres d'albums contemporains 3.1.5 Bande dessinée 3.2 Le loup à l'écran 3.2.1 Le cinéma et la télévision 3.2.2 Documentaires 3.2.3 Dessins animés 3.2.4 Jeux vidéo 3.3 Le loup en peinture et en sculpture 3.4 Le loup dans les œuvres musicales 4 Le loup et les noms propres 5 Bibliographie 6 Notes et références 7 Voir aussi 7.1 Articles connexes ...
                    Read more

                    How to solve the problem of ntp “Unable to contact time server” from KDE?

                    Image
                    1 0 I want to set date and time automatically but this error appears when I try to .. I'm using openSUSE, I tried different servers but it didn't work either, help please! It doesn't seem to be a network problem: $ ping pool.ntp.org 64 bytes from 41.78.128.17: icmp_seq=1 ttl=41 time=260 ms To the question of whether ntpd is installed and running: $ ps -C ntpd PID TTY TIME CMD i.e. there's no ntpd process running. $ rpm -qa | grep ntp yast2-ntp-client-3.1.12-1.7.noarch ntp-4.2.6p5-25.2.1.i586 Further information from the comments: $ sudo ntpdate pool.ntp.org 25 Sep 19:41:51 ntpdate[3162]: no server suitable for synchronization found networking kde opensuse ntp ntpd sh...
                    Read more

                    ASUS Zenbook UX433/UX333 — Configure Touchpad-embedded numpad on Linux

                    Image
                    0 1 I have an ASUS Zenbook UX433,on which ASUS decided to innovate by embedding a Numpad inside the touchpad (see picture 1). Toggling between classic touchpad mode and numpad (also turns the touchpad LEDs on) can be done through the golden button in the top-right corner of the touchpad. However, on my Manjaro arch Linux config, this behavior does not work by default and I can only use the touchpad, no numpad. Has anyone been able to configure the numpad to work on Linux, or have any idea how this could be achieved? EDIT1: I have had a look at the official Windows drivers for the UX433FA TouchPad, but was not able to make anything of it. I tried installing them on Linux using tools like NDISWrapper, but they do not detect the TouchPad/Numpad hardware, and my understanding of drivers is too limited. ...
                    Read more