{"entities":{"Q6961032":{"pageid":21269397,"ns":120,"title":"Item:Q6961032","lastrevid":76100739,"modified":"2026-04-22T20:21:16Z","type":"item","id":"Q6961032","labels":{"en":{"language":"en","value":"Self-dual cyclic codes with square-root-like lower bounds on their minimum distances"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8062223"}},"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":"Q6961032$EF5F0D41-DD1B-40FB-9208-C66E66A69EA0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"97530d42bfcce8f2ed28cb032b18fc73c2692bba","datavalue":{"value":{"text":"Self-dual cyclic codes with square-root-like lower bounds on their minimum distances","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6961032$16EF83F8-D25D-4B66-9A8D-6EC593FBC027","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bf82f08af6afc61470ddd43ac58006e69ba2e617","datavalue":{"value":"1573.94361","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6961032$1A1DB935-4256-482D-A1A0-721E39502A0A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5691431f0d712bf9793f7d2790b78e6c024a25d5","datavalue":{"value":"10.1109/TIT.2025.3535533","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6961032$FDD8E64D-B99E-4223-BFDC-55AF9E175DAF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3903f7c2c78971625e7762cef91d0d5441229fd1","datavalue":{"value":{"entity-type":"item","numeric-id":331516,"id":"Q331516"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6961032$8CA2ED36-CD2B-4FAB-A965-E6E3CD4F1AD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b6b3d719c03653509063435064d7878c4f77ffc4","datavalue":{"value":{"entity-type":"item","numeric-id":193602,"id":"Q193602"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6961032$C3033ADC-7DAE-46A7-85EF-3E2E5265FB6E","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":"Q6961032$8E29BAFE-3C33-4C6E-B82F-E58F3408C340","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aa8d539d1dddb3d1a003891346733ac2813f0087","datavalue":{"value":{"time":"+2025-07-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6961032$D7A9129D-A15A-4BEC-978A-86B34F8A6AF9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ccbe597853b179311d5638b907d4c28c9d67538","datavalue":{"value":"94B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6961032$89C6C225-5DB2-4040-92D6-A1ABD3BACC54","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5ad795ec0f5f57ac72ca47b9261f9d081dad8474","datavalue":{"value":"8062223","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6961032$C371E4BC-5594-4E99-8EB4-E919E4048161","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c509cbb3121bbfacf2dfa7882199be62f27f910c","datavalue":{"value":"infinite family of Euclidean self-dual cyclic codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q6961032$1AA8F453-6F5C-47B5-A07F-E9EEDC9B481D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ac07c7d6c5cdc2dbc4590f3ecbac0ebb59196bea","datavalue":{"value":"finite fields","type":"string"},"datatype":"string"},"type":"statement","id":"Q6961032$A9CEC708-115D-4E36-9AE3-CD754476FBC5","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":"Q6961032$0C98D15F-3FF8-4FDB-A0F0-2D29426E16F1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Self-dual cyclic codes with square-root-like lower bounds on their minimum distances","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Self-dual_cyclic_codes_with_square-root-like_lower_bounds_on_their_minimum_distances"}}}}}