{"entities":{"Q3259316":{"pageid":3270024,"ns":120,"title":"Item:Q3259316","lastrevid":80176631,"modified":"2026-05-06T15:36:13Z","type":"item","id":"Q3259316","labels":{"en":{"language":"en","value":"A note on upper bounds for minimum distance codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3141586"}},"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":"Q3259316$E18A4026-AE31-4C68-9508-4142902885CB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8eb6b0236cc7a96aa8d1db91bdf5f617a7fe01d9","datavalue":{"value":{"text":"A note on upper bounds for minimum distance codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3259316$CE35FA6D-A9CC-4824-ACD9-63C6B0E8B281","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ea895083743537c9b2a94aff18bd4ee4fdc1c15c","datavalue":{"value":"0086.33404","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3259316$A62018A0-263E-4645-A02E-DE3E7D43ADBB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"74058c6b3eb5d676a7fd701de03b568198cdde04","datavalue":{"value":"10.1016/S0019-9958(58)80006-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3259316$1368DF94-1A4B-45D4-B2B7-AEA3836AAEE0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cf8d71b6efd9e848bdf1c89687e0d348aba2d0d5","datavalue":{"value":{"entity-type":"item","numeric-id":3237834,"id":"Q3237834"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3259316$1F142ABD-6676-4261-8ACE-F7D22F120774","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4434820098e3b6c980c31814818af7c68f56bd22","datavalue":{"value":{"entity-type":"item","numeric-id":2832035,"id":"Q2832035"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3259316$7A593AB1-72AF-4532-91EF-3E8716B15821","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"510532e6645dd28b1ac246dd4622d0e1df04736a","datavalue":{"value":{"time":"+1958-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q3259316$66C54C01-B4A1-4B30-B3FA-22330924949E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5d2791e1676486a3261efb5ecad66aed92903d7c","datavalue":{"value":"3141586","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3259316$147D9521-B423-4FA5-8C1B-55FD8294665A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8b4d7ef2a1474c7a8bf3865cb84b00ed5b658d23","datavalue":{"value":"probability theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q3259316$AA40B3D1-AC3E-4867-A796-F184DB4BC42D","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":"Q3259316$64DF3A78-D1B3-4A84-9B15-89FA0282B0BD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A note on upper bounds for minimum distance codes","badges":[]}}}}}