{"entities":{"Q6327602":{"pageid":13463009,"ns":120,"title":"Item:Q6327602","lastrevid":94935260,"modified":"2026-06-05T08:00:06Z","type":"item","id":"Q6327602","labels":{"en":{"language":"en","value":"An Improved Linear Programming Bound on the Average Distance of a Binary Code"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900388155"}},"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":"Q6327602$F24B9735-9E31-4DC6-AE52-97843CC09B12","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"14148ad2939ae2cfe1366ca49ca889b7991a1881","datavalue":{"value":{"time":"+2019-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6327602$A9D04F21-7E62-41A9-BBC5-ABE3C6357067","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1be2bb22c2a8fc8bad2d3506cdcd41095615a72c","datavalue":{"value":{"entity-type":"item","numeric-id":254220,"id":"Q254220"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327602$165FF540-9013-4C25-96EF-7C2D1BEBC9C7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"28f12800adabcc6c514f01059c8c1b6942c998cf","datavalue":{"value":{"entity-type":"item","numeric-id":693726,"id":"Q693726"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327602$2C371C4D-52AD-4795-82F9-BF39E47DF9A2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"82630e8a67f027ca5423cb3290b665196351480a","datavalue":{"value":"900388155","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6327602$5581F38B-6A44-4F7E-BA61-03F12EBA32F1","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":"Q6327602$E85FFBFD-7F99-4CDD-852A-E30E973B477B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Improved Linear Programming Bound on the Average Distance of a Binary Code","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Improved_Linear_Programming_Bound_on_the_Average_Distance_of_a_Binary_Code"}}}}}