{"entities":{"Q5939230":{"pageid":8116032,"ns":120,"title":"Item:Q5939230","lastrevid":102002771,"modified":"2026-06-06T03:17:41Z","type":"item","id":"Q5939230","labels":{"en":{"language":"en","value":"On the minimum average distance of binary codes: Linear programming approach"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1625414"}},"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":"Q5939230$09B7EB0D-826B-44F1-9CE9-AB4AC54CF83D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5a45ad5f6eb277491fb03c8fa484be8d0bae6653","datavalue":{"value":{"text":"On the minimum average distance of binary codes: Linear programming approach","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5939230$243C55E4-9BFB-4F86-A205-BB6FAA678F55","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1df62dce2f625f49c8abc86cb0f98ffbda8da036","datavalue":{"value":"1018.94038","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$24668BAC-374F-47C5-B01D-78449DD1F077","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"558e297642ef21b0ac56268d379f196e3708aae7","datavalue":{"value":"10.1016/S0166-218X(00)00284-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$2DD653D5-1E8F-4942-AD6B-201265FB4146","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a65387e6c807bbd4b5919da9239323ec1691b41f","datavalue":{"value":{"entity-type":"item","numeric-id":182052,"id":"Q182052"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$578F3AA0-404B-4133-9D5E-CA42C84427AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d48aba1b1e34f0416068f7e9705d590d80aa1521","datavalue":{"value":{"entity-type":"item","numeric-id":193589,"id":"Q193589"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$FBC03A97-01DB-49CA-BAA8-0650523DA95D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2cc62e92527a4fb7cbb198bb21281c6807ca43ce","datavalue":{"value":{"entity-type":"item","numeric-id":193590,"id":"Q193590"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$E8F37DBA-FB3A-45D7-8C48-BFA4B9B3F97A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$9269B232-9707-4F43-93DF-51CF71C77B71","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2f656be52db48bce3ee960bd9331251d53f28ca7","datavalue":{"value":{"time":"+2003-08-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5939230$3138B2FF-B4E9-4D23-9E54-BE4075C9A202","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"99ee71fa6520b4ce016a10d1ed9468cbc843a873","datavalue":{"value":"\\textit{R. Ahlswede} and \\textit{G. Katona} [Discrete Math. 17, 1-22 (1977; Zbl 0368.05001)] posed the following problem: For given \\(n\\) and \\(M\\) with \\(1 \\leq M \\leq 2^n\\), determine the minimum average Hamming distance \\(\\beta (n,M)\\) of binary codes with length \\(n\\) and size \\(M\\). In graph-theoretic terms, this is the minimum average distance between \\(M\\) vertices of an \\(n\\)-cube. In the current paper, linear programming is used to obtain new lower bounds, which are used to determine \\(\\beta (n,M)\\) for several families of parameters, including \\(M \\in \\{2^{n-2}, 2^{n-2}\\pm 1, 2^{n-1}\\pm 2,2^{n-1}+2^{n-2}, 2^{n-1}+2^{n-2}\\pm 1,2^n-2\\}\\). An upper bound is obtained as well, based on combining codes of size \\(2^{k_i}\\) and length \\(k_i\\) (that is, cubes), where \\(M = 2^{k_1}+2^{k_2}+\\cdots\\) and \\(k_1 > k_2 > \\cdots\\). This gives optimal codes -- that is, codes attaining \\(\\beta (n,M)\\) -- in many cases but not always, since if \\(M \\leq n+1\\) and \\(M\\) is large enough, then one can take the all-zero word and \\(M-1\\) words of weight 1 to get better codes.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5939230$6F5634F8-9148-433B-8D5F-EA15607B1D5E","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"e2a5372fcb763d4f1b9b60254fe64ab16b83ff12","datavalue":{"value":{"entity-type":"item","numeric-id":180477,"id":"Q180477"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$33EF359B-7363-423B-A824-1E33B17BB437","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ab81cc6be792359bf679043e23dc40b5d9ce60b6","datavalue":{"value":"94B65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$3824FF8F-D6FF-4AF4-A6D2-549D04E48ACD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"49b058fb3bbcf2e2c0b60d335491b1fb69531246","datavalue":{"value":"05C12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$F56A4B01-7C0A-40C3-BE8A-C617C3A84D57","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$B3D9AAD8-0B7B-434A-8892-B8A2983360B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$67F2882B-8F26-4221-8870-254DEF693544","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0fc27d946e15ea096c93cb04861d1e080539bcc6","datavalue":{"value":"1625414","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$77F911DF-5B1A-4509-9517-DF5A0AC7E9C5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cce1669f887983917919bfd8b0cb00b63d36994e","datavalue":{"value":"average Hamming distance","type":"string"},"datatype":"string"},"type":"statement","id":"Q5939230$16F92D65-2E81-4A4F-B916-334F74A6B313","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b077ae6743404f647d92aa7cdb205cab2f2bd1a5","datavalue":{"value":"binary codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q5939230$9612A4EA-38E1-4880-A76C-11CE3A160302","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a08efa1a08a750d06fca0196004a17a02a35c592","datavalue":{"value":"linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q5939230$92C0DFDD-C417-4946-BFCE-9BB0D660B3D5","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":"Q5939230$E5EEB935-A969-425D-9765-B969164C53AB","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"a91d582dbbaa5ea3b8d365e395418fae5461b00e","datavalue":{"value":{"entity-type":"item","numeric-id":1333337,"id":"Q1333337"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$7574246D-16ED-4656-93BB-182D238FEE43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"827971ddb0acf18031d31cffc4e727af92dcd766","datavalue":{"value":{"entity-type":"item","numeric-id":1242920,"id":"Q1242920"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$07F02A94-F80E-4572-8F57-C034A4144668","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a8bcc3c28145fc0c8f7acaf7363b2c0ed1a08b90","datavalue":{"value":{"entity-type":"item","numeric-id":1123626,"id":"Q1123626"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$63E7BCC0-A027-4693-81C5-98C792A93FE6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"22720b8026406d6389fe348b6fcac05a0ff21c1a","datavalue":{"value":{"entity-type":"item","numeric-id":757399,"id":"Q757399"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$DF2759A5-420F-4FD9-9609-8B08361E07A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc62645caeed7a2ea70af92d0d4bc50905e6569d","datavalue":{"value":{"entity-type":"item","numeric-id":4146671,"id":"Q4146671"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$8F21DEE3-C533-4D75-8C8B-C9343FD258A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0d92d6f7feb8913087dce126378f63c63c6d7233","datavalue":{"value":{"entity-type":"item","numeric-id":4119093,"id":"Q4119093"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$B8A779CF-4E60-4F86-A53B-8ADE06EB237A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c09f9d7c30069c6b48622600828783a2e7d02ef6","datavalue":{"value":{"entity-type":"item","numeric-id":4701337,"id":"Q4701337"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$454C9DD6-3E83-4EFB-9C46-6917029A45A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4f2e4c4cf2618eec53ee65fd425d9c4d2079f889","datavalue":{"value":{"entity-type":"item","numeric-id":1387601,"id":"Q1387601"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$598D4555-EB07-4B75-915F-AAEDE8D46D1B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3e41dd912d49b86c9cdae5aaf285e1467026d2e4","datavalue":{"value":{"entity-type":"item","numeric-id":4242950,"id":"Q4242950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$27EDD15E-3BBD-4F41-95EE-61AAB809A81C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3a0ca5163da3c8c3598911be50985554fc6c7849","datavalue":{"value":{"entity-type":"item","numeric-id":3807119,"id":"Q3807119"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$06DB370C-1538-42B2-A433-333BD1960F5B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"701c90e35bc63f4c9ea69da63e0ad72bcc654037","datavalue":{"value":{"entity-type":"item","numeric-id":1281403,"id":"Q1281403"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5939230$C8821760-7837-4DA4-BE92-6650D5A3684F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"95a8e86a4f28997c90987d948ef7661d0082b992","datavalue":{"value":"https://doi.org/10.1016/s0166-218x(00)00284-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q5939230$027D9DCC-85D8-484A-8389-377D4BFE3600","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"dfdb0dfd76ea2f3a79670af1444909af04e63f51","datavalue":{"value":"W1976116479","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5939230$24B37617-F4C6-4C71-A065-5827082CBE42","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2103ebdac724ed45d564447461457b6b88149f3b","datavalue":{"value":{"entity-type":"item","numeric-id":998361,"id":"Q998361"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fceeb91682c3bd2a413911b7d81a3eb8fedeb97d","datavalue":{"value":{"amount":"+0.9529057145118712","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":"Q5939230$878EC335-0851-4C09-B1E5-58C0F1391EED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6588be251b443d972a507e50265aef5169e8f7c5","datavalue":{"value":{"entity-type":"item","numeric-id":1281403,"id":"Q1281403"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4dea2067b5d5f65c007b1c82a20ba3cb6a7e227b","datavalue":{"value":{"amount":"+0.9178050756454468","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":"Q5939230$2A7F3C13-C180-4B67-969F-647083C7D258","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7678d5997ddcb58d49f62f851afa8c74819d3a36","datavalue":{"value":{"entity-type":"item","numeric-id":932637,"id":"Q932637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"af059f2dab2f62141dd6ccd60ee6eca65e7d3109","datavalue":{"value":{"amount":"+0.8865905404090881","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":"Q5939230$A0027667-B68B-41DC-B94B-05687FCDDA88","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e48b0623ca7236b594e7ecd6a757725c8533474d","datavalue":{"value":{"entity-type":"item","numeric-id":2721892,"id":"Q2721892"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1642dfbb9dad2d20ce874092cdc96ea6c5066ea0","datavalue":{"value":{"amount":"+0.8392796516418457","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":"Q5939230$856E7F04-B926-4E2B-BE00-081DBC68B3DC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a3d6154bdec2e00c4a7d1fa60cbe713dd6b3c1a2","datavalue":{"value":{"entity-type":"item","numeric-id":4202097,"id":"Q4202097"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"99be8bd4fdf2c985df26f910861a5110074794a7","datavalue":{"value":{"amount":"+0.8385654091835022","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":"Q5939230$53C5017A-6A46-4361-8CE5-C0A32E9C55CB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the minimum average distance of binary codes: Linear programming approach","badges":[]}}}}}