{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T19:11:47Z","timestamp":1761937907957,"version":"build-2065373602"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/wcnc.2005.1424816","type":"proceedings-article","created":{"date-parts":[[2005,4,25]],"date-time":"2005-04-25T18:49:51Z","timestamp":1114454991000},"page":"1939-1944","source":"Crossref","is-referenced-by-count":36,"title":["Distributed source coding in wireless sensor networks using LDPC coding: the entire Slepian-Wolf rate region"],"prefix":"10.1109","volume":"4","author":[{"given":"M.","family":"Sartipi","sequence":"first","affiliation":[]},{"given":"F.","family":"Fekri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258595"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365489"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258595"},{"key":"15","first-page":"330","article-title":"Approaching the Slepian-Wolf boundary using practical channel codes","author":"cabarcas","year":"2004","journal-title":"Proc of IEEE International Symposium on Information Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281475"},{"key":"14","article-title":"Slepian-Wolf coding of three binary sources using LDPC codes","author":"liveris","year":"2003","journal-title":"Proc 3rd Intl Symp on Turbo Codes"},{"key":"11","article-title":"Distributed code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources","author":"schonberg","year":"2004","journal-title":"Proc IEEE Data Compression Conference"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP.2002.1203246"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889701"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838176"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2004.1381931"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1999.755665"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.804244"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.803479"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.1000008"},{"key":"5","first-page":"252","article-title":"Compression with side information using turbo codes","author":"aaron","year":"2002","journal-title":"Proc IEEE Data Compression Conference"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917159"},{"key":"9","article-title":"LDPC codes can approach the Slepian-Wolf bound for general binary sources","author":"schonberg","year":"2002","journal-title":"Proc of fortieth Annual Allerton Conference"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/4234.957380"}],"event":{"name":"IEEE Wireless Communications and Networking Conference, 2005","location":"New Orleans, LA, USA"},"container-title":["IEEE Wireless Communications and Networking Conference, 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9744\/30731\/01424816.pdf?arnumber=1424816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T22:47:38Z","timestamp":1489531658000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1424816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2005.1424816","relation":{},"subject":[]}}