{"entities":{"Q3671037":{"pageid":5700943,"ns":120,"title":"Item:Q3671037","lastrevid":90573062,"modified":"2026-06-04T20:43:51Z","type":"item","id":"Q3671037","labels":{"en":{"language":"en","value":"Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3823650"}},"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":"Q3671037$A45604F7-804A-49A1-8528-7D1E850C07BD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5eda1654c7eff29ba8e92a8a6295f85c3bcd590a","datavalue":{"value":{"text":"Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3671037$C56A4773-C7B0-482D-80B7-3496E193B4DA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f099434a07e18d6107945b8ab87926a6e1241265","datavalue":{"value":"0519.94003","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$37277BFB-B167-4B3C-A15D-F52DA2794CE9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"df38a99e27727f877d791a10b1752c89222b773e","datavalue":{"value":"10.1109/TIT.1983.1056614","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$00E7F937-8ECC-4AA5-B66B-2E63B412B6C0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5ac8477c8571818916759218f885a65ca2902ef6","datavalue":{"value":{"entity-type":"item","numeric-id":1060027,"id":"Q1060027"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3671037$2C0C3C99-2C72-4696-92C7-982BA977B2A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3ede3b7fe40eaa48e351fd9830189c1cc5ea842e","datavalue":{"value":{"entity-type":"item","numeric-id":364990,"id":"Q364990"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3671037$E60F1654-4F6C-407E-A167-723655E4E234","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d48aba1b1e34f0416068f7e9705d590d80aa1521","datavalue":{"value":{"entity-type":"item","numeric-id":193589,"id":"Q193589"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3671037$DE4C29B8-32F5-48E1-811D-EE36EBF7DCD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"87a446c8f6a0d889df27f26346deeb24afdead06","datavalue":{"value":{"entity-type":"item","numeric-id":1958837,"id":"Q1958837"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3671037$271A033F-06A8-44FE-84C7-8452E0C2DB8A","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":"Q3671037$695D06C3-0629-4A53-AB42-71B366E06B91","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0136733d5dd7d9f4d36f24c87a0b8375ae1cb2fd","datavalue":{"value":{"time":"+1983-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":"Q3671037$CEB2B957-41E3-4631-88E4-CC118E8C2F20","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"23eabea2f37667b79d34f4282bba7b6c227abf51","datavalue":{"value":"94A24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$FE0F6CA0-4D3B-4D44-B326-122C21B6ACF7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"13e38350673ed3dfbbcab128fb958c8c2b0859f1","datavalue":{"value":"94A40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$5444AE88-9C0B-4535-9B36-6168A5EDB751","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$F682C021-832C-4DD8-A2B0-2A613D3B9AA4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ddec4e27702a4af3510d66c184c63bc18a0f5506","datavalue":{"value":"3823650","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3671037$AB078A6F-1CF8-4D63-A0B0-68AD11199533","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a60def6fc1f11558db4dfcf078f47611ff6f5b5d","datavalue":{"value":"two-user multiple-access binary adder channel","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$2A265BB0-2551-448F-A68E-70AB4D404242","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a4d9db5a3159f1935bce11a13ceab73f2faa05ac","datavalue":{"value":"multiple-access communication","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$94D9E76F-6D84-462D-BC29-D74B369F5C2F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8058b200b22925b4cc0e0b90611e52dd9bba4ed6","datavalue":{"value":"independent set problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$25AAF515-B69D-4DD3-AE59-684FB1BFB318","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"872cea187ef43acf4b138cdfc6042d30a5ee5634","datavalue":{"value":"independence number of a simple graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$50D3B0EA-3403-4DE7-9049-EE02E369E0A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4163e4738c58c1af1294e25a5b95acd8887d4ade","datavalue":{"value":"lower bounds on the achievable rates","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$AAB4F8E0-605A-4484-BC69-FCA8D2DD7877","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"04851dbba3c33ff94dfc08fe2112298c656c2e8a","datavalue":{"value":"synchronized adder channel","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$15F6EC05-40DD-495C-B309-97E4CF6E1F52","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"013a1dd807eec82de2efc935e4ccce8c0e746652","datavalue":{"value":"uniquely decodable codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$6A61F890-F821-41AA-AE6F-DB6B6ADB1FFC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b6bd9af62e5b47ca3635b2f34e5c9a65fa81f15a","datavalue":{"value":"nonsynchronized adder channel","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$F8BD7372-4E3A-4874-9844-BAEDA8F2ACA0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85931b52c805f1a1519bf276843ca497248c98aa","datavalue":{"value":"Deaett-Wolf codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$DB3EE582-8437-4AA3-9BEA-BC8AE6475A21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e0782a870681a14836ce10517978ccf812c825a5","datavalue":{"value":"synchronizing sequences","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$8476E16A-E8E6-4655-B4CA-575C42A5767E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"86b6b5e99cf57c45d44e3c9ac6b926475dbe7965","datavalue":{"value":"delta-decodable codes","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$9503D517-1D1A-48C0-8D0B-EDAAF8077DB2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fdcfbcf14da2a09aa8ca5e40a68c192831d5513b","datavalue":{"value":"multi-user communication","type":"string"},"datatype":"string"},"type":"statement","id":"Q3671037$749FCBC2-C20D-436F-8E7C-BCF413A1CA49","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":"Q3671037$FFAC77CA-ED61-4075-8633-FD15A672520E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graph_theoretic_approaches_to_the_code_construction_for_the_two-user_multiple-_access_binary_adder_channel"}}}}}