{"entities":{"Q426843":{"pageid":428610,"ns":120,"title":"Item:Q426843","lastrevid":61796496,"modified":"2026-04-11T01:42:59Z","type":"item","id":"Q426843","labels":{"en":{"language":"en","value":"Hamiltonicity of minimum distance graphs of 1-perfect codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6045689"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q426843$C7A2AD36-1C35-4327-8B21-8F691D371F4F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b4349aab2b045078a6e49beb16e73c268f006996","datavalue":{"value":{"text":"Hamiltonicity of minimum distance graphs of 1-perfect codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q426843$41213FFA-5CF1-4D76-B4EA-36E3656EA388","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"25c0d768cfc92dbe5765a4af23953b81a72818e7","datavalue":{"value":"1243.05142","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$3AD9DDCD-14EA-455A-884B-7CA5135D33FB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9b3c09429f532c97dd89b34fd878f359afc21efb","datavalue":{"value":{"entity-type":"item","numeric-id":426842,"id":"Q426842"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q426843$0FCE886F-3819-4204-AB28-861705129EDB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ebc7441ecfd9ecfa38d48ddc4b2adb39ac7d7000","datavalue":{"value":{"entity-type":"item","numeric-id":161296,"id":"Q161296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q426843$732CFA5D-E6F8-40A2-8646-1EAD2A355D28","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4bc8e8f32e3771ea3dc331f4cf4795267b160813","datavalue":{"value":{"time":"+2012-06-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q426843$9AEEA9B7-CE68-4086-B3E6-5DDA1A5206CF","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2848f8a511e556fccc2004159cca3729c2040a22","datavalue":{"value":"http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p65","type":"string"},"datatype":"url"},"type":"statement","id":"Q426843$AC4EBB52-88CC-412C-93CB-337742787F0A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"fa5bdc7e74ae2c58e8cc72222441239a5cdd3ea4","datavalue":{"value":"Summary: A 1-perfect code \\(\\mathcal{C}_{q}^{n}\\) is called Hamiltonian if its minimum distance graph \\(G(\\mathcal{C}_{q}^{n})\\) contains a Hamiltonian cycle. In this paper, for all admissible lengths \\(n \\geq 13\\), we construct Hamiltonian nonlinear ternary 1-perfect codes, and for all admissible lengths \\(n \\geq 21\\), we construct Hamiltonian nonlinear quaternary 1-perfect codes. The existence of Hamiltonian nonlinear \\(q\\)-ary 1-perfect codes of length \\(N = qn + 1\\) is reduced to the question of the existence of such codes of length \\(n\\). Consequently, for \\(q = p^r\\), where \\(p\\) is prime, \\(r \\geq 1\\) there exist Hamiltonian nonlinear \\(q\\)-ary 1-perfect codes of length \\(n = (q ^{m} -1) / (q-1)\\), \\(m \\geq 2\\). If \\(q =2, 3, 4\\), then \\( m \\neq 2\\). If \\(q =2\\), then \\( m \\neq 3\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$7E524A6E-F2E9-4D0B-B033-9BFBBE108ECB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"eef1b49f4a66afb755b22d7419db9d61ba07415f","datavalue":{"value":"05C45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$A25867B2-2CF4-4809-AFCD-B12A82FB1C8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"49b058fb3bbcf2e2c0b60d335491b1fb69531246","datavalue":{"value":"05C12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$2D23D8FB-5EC7-4D5A-AA6C-EEDB74AE0BFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0c3cdafa68da1cd8441c02cae1d4f7b344a92c14","datavalue":{"value":"94B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$CC152131-C477-4739-9EDA-D950BBE513B2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e7d68f358493b31b9c7f30d7b18ec17b51b26656","datavalue":{"value":"6045689","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$E0AA5718-074D-402A-8C68-98D999A0BF75","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0612807c22f01764e2b3d07b2bb1c1365e520f64","datavalue":{"value":"Hamiltonian cycle","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$5C01DC3D-D1A3-4A9B-97E5-6268C44B9BCE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cd224cf48fcc405274187d12bd2a95994183bf89","datavalue":{"value":"minimum distance graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$F8F338B0-87A8-4D1C-AEA7-06DF9B8DD6F5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4fa517dec81a1200ef9dbff4dc0da77ac341867f","datavalue":{"value":"Hamming code","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$34B328F9-D88C-4C21-AFAC-0D7A7500A207","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"664786ee33451e6e791ab5e49e29a2465b3b31dc","datavalue":{"value":"nonlinear code","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$DB0C2997-CB51-4958-994F-30A99287BF4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd11196105deb8fbcbb2fcb962cbd1c7b4e7e239","datavalue":{"value":"\\(q\\)-ary 1-perfect code","type":"string"},"datatype":"string"},"type":"statement","id":"Q426843$3EF9B08A-1946-4715-9045-E6114F943516","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q426843$9B3B1AAC-1AF4-4274-A75B-72BDD302711D","rank":"normal"}],"P1633":[{"mainsnak":{"snaktype":"value","property":"P1633","hash":"49a00c1f2245b08416a179eae7355ca450751bb0","datavalue":{"value":"bafkreif627rvysqyjmoqyfgyisvxztlpphwjldxi6nfzphckhoublepapm","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q426843$F621B0B5-6402-4B3F-9AC0-F5247056B8B5","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bb5880382bd501a95748df375bba6b0a5eb695d6","datavalue":{"value":{"entity-type":"item","numeric-id":4595650,"id":"Q4595650"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9c7c9c89a9666b2c51fa2c1b579ae7630c9ced29","datavalue":{"value":{"amount":"+0.9172600507736206","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q426843$4B677CA1-54EE-440F-BFA5-419EBF4FD33C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7c8f59fba54d12c4e831cd8a883f831d9d5bef3d","datavalue":{"value":{"entity-type":"item","numeric-id":3225885,"id":"Q3225885"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"69a25581769b29495aca8336fdb844c621c357fb","datavalue":{"value":{"amount":"+0.8026047348976135","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q426843$73F9B2F5-3892-4B60-92CB-A81424143B4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"43937e139aeffd991a81635f6ae1dfa5c79b983a","datavalue":{"value":{"entity-type":"item","numeric-id":526235,"id":"Q526235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"419c8248e9fbde48f12cba18c8792bc4b9798de2","datavalue":{"value":{"amount":"+0.7769289612770081","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q426843$84FE3707-4238-4CFC-8A50-8FB68647095E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3c70a42825b83077e9457d162b5ca9be345f176d","datavalue":{"value":{"entity-type":"item","numeric-id":1057833,"id":"Q1057833"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f915ce46e2e12f03cae7674042234e52aad8c5bd","datavalue":{"value":{"amount":"+0.7636803984642029","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q426843$E0F52552-1DB6-45A0-99C6-A4A3C6FECC4B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ea400602be9bbfa26e219aa33384e62cb5caed79","datavalue":{"value":{"entity-type":"item","numeric-id":2275889,"id":"Q2275889"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d7bb5de71945d6237340b08c0d284f5d6641dc77","datavalue":{"value":{"amount":"+0.7579540610313416","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q426843$CE95BF58-02D3-45E5-8DA4-D54AEFC1968E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Hamiltonicity of minimum distance graphs of 1-perfect codes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Hamiltonicity_of_minimum_distance_graphs_of_1-perfect_codes"}}}}}