{"entities":{"Q5124437":{"pageid":7154011,"ns":120,"title":"Item:Q5124437","lastrevid":94321688,"modified":"2026-06-05T06:30:52Z","type":"item","id":"Q5124437","labels":{"en":{"language":"en","value":"Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7253345"}},"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":"Q5124437$FA33E908-CAC3-4826-B2E9-8295832D3790","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"07a1d3cf9052ad7727fbf80831fd4e4edbf237b6","datavalue":{"value":{"text":"Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5124437$BD29E594-E974-4E93-B740-F65697A12AF5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8539207a439f1f3914f6e4b25b00b3ce7396ea91","datavalue":{"value":"1446.94083","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5124437$17B8BEB2-33E8-4D35-A0F2-A1D267F8A446","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0a1c05eed65c8aff5e663b23081640466dc9feee","datavalue":{"value":"10.1109/TIT.2020.2987309","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5124437$B94A5728-EBAB-4757-AA82-CD8B8EF2FD76","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3eb7b1ab857db9fa53bff8fa1b6156b30cf60e6c","datavalue":{"value":{"entity-type":"item","numeric-id":5124436,"id":"Q5124436"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5124437$9CFC56F1-1155-4667-9B78-15EDADDA5F4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fc5836b1d32f50f3b63ddf93f6e9e047c8b922ae","datavalue":{"value":{"entity-type":"item","numeric-id":1026266,"id":"Q1026266"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5124437$03AF3639-5446-4178-8A53-7835D7FBA0A4","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":"Q5124437$C06AFD0F-9307-4FC4-BB96-DFA6F4ACD2FB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d0652841789b3a93b183e2d44989ea88a732fc81","datavalue":{"value":{"time":"+2020-09-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5124437$3F56AB64-9CE0-4E2E-B9BF-15FBDA312AA9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"cf807832f23b1843158a0f1abb6a671308ea384a","datavalue":{"value":"94A45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5124437$2DFDF95C-3736-4829-8AA0-FD449BABA298","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e002f9d95578894fc0e3ce5ddc9e7724203b69b7","datavalue":{"value":"7253345","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5124437$9E3F1A14-7004-4C13-BC58-DB06ADC05721","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":"Q5124437$D6A1A263-BC85-464B-9819-7AD1F8205256","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6c695e903035b82ab1ada674c24d499b91007a70","datavalue":{"value":"https://doi.org/10.1109/tit.2020.2987309","type":"string"},"datatype":"url"},"type":"statement","id":"Q5124437$30DCAFB0-1EE5-436E-A39A-904CA632F7A1","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"af16656f261b5e90bf1b615c5fb373c22cd4bc48","datavalue":{"value":"W3016500741","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5124437$1CDB08FB-2B73-42D0-99C8-542D66B0F15C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Some_Tight_Lower_Bounds_on_the_Redundancy_of_Optimal_Binary_Prefix-Free_and_Fix-Free_Codes"}}}}}