{"entities":{"Q5211396":{"pageid":7240967,"ns":120,"title":"Item:Q5211396","lastrevid":91805486,"modified":"2026-06-05T00:07:06Z","type":"item","id":"Q5211396","labels":{"en":{"language":"en","value":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7158743"}},"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":"Q5211396$C89E688B-4678-4F6F-92F6-2FB66C71D9E6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a00bbfca4c94ef4667cfcbeb26b5578460a082a9","datavalue":{"value":{"text":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5211396$D123DE9D-E208-4C2D-AB25-132A24DF2935","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f77349b80241bfa5beba5f7bf606c0797a1a94ce","datavalue":{"value":"1432.94211","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$5BE3A448-33DE-4A10-8F38-6AFF3030BE4C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"849964687ef6a8eb883043f1eb214b5b5105ec15","datavalue":{"value":"10.1109/TIT.2019.2917683","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$C43888C9-010A-465A-A9D8-EDAFC3F4CB78","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d1a060c56b5661f37bcd9e463b9229799adf30ab","datavalue":{"value":{"entity-type":"item","numeric-id":2977419,"id":"Q2977419"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211396$F71FABC9-0C5F-4A25-8D54-ADF97FF92DB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a435e61c1934ac4c43de51b4b62bf0bd54f5f9c","datavalue":{"value":{"entity-type":"item","numeric-id":871448,"id":"Q871448"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5211396$44B2F46C-51B7-4FC8-BB06-F9B046EFB574","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":"Q5211396$0EB2E083-1052-4952-A94E-126A362DA290","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c3667234f64e059790aacf6846d4478bb70e09b7","datavalue":{"value":{"time":"+2020-01-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":"Q5211396$6BA82547-3A46-4A84-A5F6-75B9ECD1C1F3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ab81cc6be792359bf679043e23dc40b5d9ce60b6","datavalue":{"value":"94B65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$32894372-4375-4104-BB2D-96C9ECD445C5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"be6a5328849206c2ecb6576db9471e10dc2fffa1","datavalue":{"value":"7158743","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$EBAD3F11-3AB0-4E23-8582-3A956582675A","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":"Q5211396$A544B385-7BEE-432B-8BA7-F91F277A8683","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"179f0fe44f62ac3e096fabab5248815ece2d4a0a","datavalue":{"value":"https://doi.org/10.1109/tit.2019.2917683","type":"string"},"datatype":"url"},"type":"statement","id":"Q5211396$70D8E3B7-1D1F-4262-8E14-8E3BF11BC6EC","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3bf973e9e5fda912abcce27ac7e9a8c8e9bf3663","datavalue":{"value":"W2945448702","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$BAC8262F-DDD3-4E1C-B54D-B69CC4F2A46E","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"b2306df39239084017e49b7b9bbb7c448ccdb419","datavalue":{"value":"Q127815041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5211396$660867E3-275A-4EC0-BC21-A58D79010DA3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Upper_and_Lower_Bounds_on_the_Computational_Complexity_of_Polar_Encoding_and_Decoding"}}}}}