{"entities":{"Q2852898":{"pageid":2863618,"ns":120,"title":"Item:Q2852898","lastrevid":42272236,"modified":"2025-06-04T01:20:32Z","type":"item","id":"Q2852898","labels":{"en":{"language":"en","value":"Non-recursive \\(\\mathrm{MAX}^{\\ast}\\) operator with reduced implementation complexity for turbo decoding"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6216897"}},"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":"Q2852898$E1D87CAF-E826-45DC-AEA5-C61A49ED3E07","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"15966f60a0438d36d9652e622f09dece3a76e76b","datavalue":{"value":"1273.94396","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$0CDE4BA9-BF58-43A3-90EC-38893FC95E21","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"62b29dc9032fb8f7e770d6db9f3b486c3df2ef98","datavalue":{"value":{"entity-type":"item","numeric-id":2852897,"id":"Q2852897"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2852898$F1586F2D-9262-4A73-AD63-F6FFCCAC5FDA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1e6eb989b0fb1beb1f93869550a26841e0aca724","datavalue":{"value":{"entity-type":"item","numeric-id":2732980,"id":"Q2732980"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2852898$1CE73637-7ABA-4BE7-AEE0-7BC0D70B2D38","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"540f0c1c1f041beb0b35ae0118d2fa7d5dfd058a","datavalue":{"value":{"entity-type":"item","numeric-id":538459,"id":"Q538459"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2852898$83DD99DC-91D4-4A42-881D-3245B3EE27F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"421b0d488f02ad06a350cfff2d0b60b1c668a945","datavalue":{"value":{"entity-type":"item","numeric-id":538458,"id":"Q538458"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2852898$A63E5725-7A94-452A-B44C-D5C27985ACCA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d81e03ce486272f9a036481c4c0b73efb19e36d1","datavalue":{"value":{"entity-type":"item","numeric-id":2852633,"id":"Q2852633"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2852898$D8177855-8975-4DB2-A669-42E3EDE20C69","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e1b5304373ae38bc09a24211814db713fe903318","datavalue":{"value":{"time":"+2013-10-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2852898$CAD3E08F-A8B9-4E38-AFA3-D07583D2A972","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0eefa8ebc57fc687470ade25860d0a4a8e503671","datavalue":{"value":"94B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$21198FE1-4A42-43E3-AEDC-F584728BC1F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$37F9625B-C105-4FDF-A418-C9508F3041A7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0789902c8bc3f4423af1f2255258bc8e366005c1","datavalue":{"value":"6216897","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$82933087-02C7-423B-9DA4-FF282EF6697E","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":"Q2852898$826C8A11-6132-4AF3-96A1-8003927AAB0C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c5314ff2eae3d4d64c1d05c9da15177d6e9347db","datavalue":{"value":"https://doi.org/10.1049/iet-com.2011.0217","type":"string"},"datatype":"url"},"type":"statement","id":"Q2852898$EF20A345-5E19-4094-97D4-48FFA8F8DA7A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3d90d9e3857f430ad60fba59c4eecb2f7932a329","datavalue":{"value":"W1968441752","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$A503DB68-0795-4513-B0EB-CD16732E6527","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7e62ebdc181ab83bd9e46446c73b5c6e31a93262","datavalue":{"value":"10.1049/IET-COM.2011.0217","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2852898$D51595FD-FF68-4F2C-8904-6941A639B27D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8c4eb4341b608d32127749b9166b1268b4d2eeb3","datavalue":{"value":{"text":"Non-recursive \\(\\mathrm{MAX}^{\\ast}\\) operator with reduced implementation complexity for turbo decoding","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2852898$3A9ED9A8-3105-44A2-AE50-267816749570","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2852898","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2852898"}}}}}