{"entities":{"Q6670285":{"pageid":14281442,"ns":120,"title":"Item:Q6670285","lastrevid":103874426,"modified":"2026-06-06T08:22:36Z","type":"item","id":"Q6670285","labels":{"en":{"language":"en","value":"Cyclic and negacyclic codes with optimal and best known minimum distances"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7973929"}},"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":"Q6670285$1DD0988A-B3D1-43B8-A87C-2CCFCD4F880C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e2af64b86d8798f1818472c7d2adfc7d33099026","datavalue":{"value":{"text":"Cyclic and negacyclic codes with optimal and best known minimum distances","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6670285$3643587D-952B-401F-BF7B-19B85F71E0C6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e6653b076e574b417a97fb5611302ce9edf4dec2","datavalue":{"value":{"entity-type":"item","numeric-id":6550767,"id":"Q6550767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6670285$B397270F-2AEB-41DA-A226-A56A2D41F4CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0bd0d80d89a26b0047e3965ba79611c6f189daa1","datavalue":{"value":{"entity-type":"item","numeric-id":2144595,"id":"Q2144595"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6670285$8350C84B-9A7F-4AC9-961F-A8F47E1E7A87","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":"Q6670285$C669B5FE-DA4C-4847-B9FD-46F5F7AE4498","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6fb5322e05cda38ce9581e6d2f97d2f129f04d5c","datavalue":{"value":{"time":"+2025-01-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6670285$A49ED4F0-9533-4FA8-B016-B329470E0161","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6670285$08C3C2D9-091B-49D4-B91F-4E556B555D60","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c9b68beb29e84d3d6fa6b1ff96a732de4dfca8fc","datavalue":{"value":"7973929","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6670285$A691EB72-3078-40EB-A6EB-07825E7184AB","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":"Q6670285$E623A3FC-0CF3-4A98-80E7-1A23886A3852","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"46364eefbc67ef80506440ff26499cb28700033e","datavalue":{"value":"10.1109/TIT.2024.3424290","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6670285$11D9083B-A060-4E18-B515-CBBFF35364C1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Cyclic and negacyclic codes with optimal and best known minimum distances","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Cyclic_and_negacyclic_codes_with_optimal_and_best_known_minimum_distances"}}}}}