{"entities":{"Q2976445":{"pageid":2987170,"ns":120,"title":"Item:Q2976445","lastrevid":79713860,"modified":"2026-05-06T14:32:49Z","type":"item","id":"Q2976445","labels":{"en":{"language":"en","value":"On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6709283"}},"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":"Q2976445$4729818E-F2B0-41E9-B47F-ABF8BB9930EF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8d7504d14d4f9773221c64012e8da824fedd8629","datavalue":{"value":{"text":"On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2976445$0D922D66-B1A8-4631-81FC-D5CC860A965F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"11f6869cc01da55c6f2d4a95a35ccd52058324ad","datavalue":{"value":"1359.94848","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2976445$190CFDA7-D95F-45A6-981A-B79E9771C7C8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f60dc3b5c2970dedb742728ca7adaaf44b038a0d","datavalue":{"value":"10.1109/TIT.2016.2616127","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2976445$85627872-7999-40EA-929A-2C82524AAEC6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d4b1bdfe9bbce6f37bc05135588e93d44b83d3c4","datavalue":{"value":{"entity-type":"item","numeric-id":188711,"id":"Q188711"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2976445$D15C30B4-514D-44CB-AAB3-A604FE1DCCCF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2568305b44781eb18d78f5bb9ecb64792381a19","datavalue":{"value":{"entity-type":"item","numeric-id":398978,"id":"Q398978"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2976445$E5FE555F-B0B8-40E2-9007-7F14FCE6631B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90c5240c9cd9e181a1b77d3501d191b6631d1861","datavalue":{"value":{"entity-type":"item","numeric-id":97723,"id":"Q97723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2976445$72051BA5-0F1B-4F24-ACAE-7A78D135067F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6a3389b68ef12c49991a5b78788c78789e180699","datavalue":{"value":{"time":"+2017-04-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2976445$BFBF5FC9-049B-45F6-B769-6F487E70BF2D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2976445$A0E92B1D-A4A7-4EE5-8DFF-358343D267AE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"aad3ebbbcd3f12aeed0f2438df54c4b1050d3cee","datavalue":{"value":"6709283","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2976445$479B5DF0-1EA0-4A49-98EE-2F7D033166CA","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":"Q2976445$E37D52AA-0431-4108-A7A5-AF793493C521","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f481f3e37d9992b7d6cfce247ddc0ab3a953528e","datavalue":{"value":"https://doi.org/10.1109/tit.2016.2616127","type":"string"},"datatype":"url"},"type":"statement","id":"Q2976445$FB767D4E-EFCE-4F26-8149-E1FE71982B53","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9604d257985618c56250c2f977b7bdfdeef15ba0","datavalue":{"value":"W2963320596","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2976445$AEB382BF-A222-452E-B402-0BE66A1CC26E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes","badges":[]}}}}}