iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.3934/AMC.2015.9.87
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T19:49:31Z","timestamp":1723060171307},"reference-count":22,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.3934\/amc.2015.9.87","type":"journal-article","created":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T17:34:18Z","timestamp":1424799258000},"page":"87-103","source":"Crossref","is-referenced-by-count":3,"title":["Polar codes for distributed hierarchical source coding"],"prefix":"10.3934","volume":"9","author":[{"given":"Min","family":"Ye","sequence":"first","affiliation":[]},{"name":",Department of ECE and Institute for Systems Research, University of Maryland, College Park, MD 20742","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[]},{"name":",Dept. of ECE and Institute for Systems Research, University of Maryland, College Park, MD 20742","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"1","doi-asserted-by":"publisher","first-page":"5437","DOI":"10.1109\/TIT.2012.2201374","article-title":"Polar codes for the $m$-user multiple access channel,","volume":"58","author":"E. Abbe","year":"2012","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TIT.1985.1057102","article-title":"The rate-distortion region for multiple descriptions without excess rates,","volume":"31","author":"R. Ahlswede","year":"1985","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"3","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,","volume":"55","author":"E. Arikan","year":"2009","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"4","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1109\/ISIT.2010.5513567","article-title":"Source polarization,","author":"E. Arikan","year":"2010","journal-title":"in Proc. IEEE Int. Symp. Inf. Theory<\/em>"},{"key":"5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TIT.1982.1056588","article-title":"Achievable rates for multiple descriptions,","volume":"28","author":"A. El Gamal","year":"1991","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/18.75242","article-title":"Successive refinement of information,","volume":"37","author":"W. Equitz","year":"1991","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"journal-title":"preprint","article-title":"Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component,","author":"T. C. Gulcu","key":"7"},{"journal-title":"preprint","article-title":"Interactive function computation via polar coding,","author":"T. C. Gulcu","key":"8"},{"key":"9","doi-asserted-by":"publisher","first-page":"7829","DOI":"10.1109\/TIT.2013.2282305","article-title":"Polar coding without alphabet extension for asymmetric models,","volume":"59","author":"J. Honda","year":"2013","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.5075\/epfl-thesis-4461","article-title":"Polar Codes for Channel and Source Coding<\/em>,","author":"S. B. Korada","year":"2009","journal-title":"Ph.D thesis"},{"key":"11","first-page":"11","article-title":"Hierarchical coding of discrete sources,","volume":"16","author":"V. N. Koshelev","year":"1980","journal-title":"Probl. Inform. Trans.<\/em>"},{"key":"12","first-page":"20","article-title":"Estimation of mean error for a discrete successive-approximation scheme,","volume":"17","author":"V. N. Koshelev","year":"1981","journal-title":"Probl. Inform. Trans.<\/em>"},{"key":"13","first-page":"31","article-title":"Divisibility of discrete sources with symbol-wise additive error measure,","volume":"30","author":"V. N. Koshelev","year":"1994","journal-title":"Probl. Inform. Trans.<\/em>"},{"key":"14","doi-asserted-by":"publisher","first-page":"6428","DOI":"10.1109\/TIT.2011.2162275","article-title":"Achieving the secrecy capacity of wiretap channels using polar codes,","volume":"57","author":"H. Mahdavifar","year":"2011","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"15","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TIT.2014.2368555","article-title":"Achieving Marton's region for broadcast channels using polar codes,","volume":"61","author":"M. Mondelli","year":"2015","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"16","doi-asserted-by":"publisher","first-page":"2720","DOI":"10.1109\/TIT.2014.2312181","article-title":"Source and channel polarization over finite fields and Reed-Solomon matrices,","volume":"60","author":"R. Mori","year":"2014","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"17","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2012.2219035","article-title":"Polar codes for $q$-ary channels, $q=2^r$,","volume":"59","author":"W. Park","year":"2013","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1109\/18.272493","article-title":"Successive refinement of information: Characterization of achievable rates,","volume":"40","author":"B. Rimoldi","year":"1994","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"journal-title":"preprint","article-title":"Polar codes for some multi-terminal communications problems,","author":"A. Sahebi","key":"19"},{"key":"20","doi-asserted-by":"publisher","first-page":"1636","DOI":"10.1109\/TIT.2004.831781","article-title":"On successive refinement for the Wyner-Ziv problem,","volume":"50","author":"Y. Steinberg","year":"2004","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1976.1055508","article-title":"The rate-distortion function for source coding with side information at the decoder,","volume":"22","author":"A. Wyner","year":"1976","journal-title":"IEEE Trans. Inform. Theory<\/em>"},{"key":"22","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1109\/ALLERTON.2009.5394494","article-title":"LDGM-based codes for successive refinement,","author":"Y. Zhang","year":"2009","journal-title":"in 47th Ann. Allerton Conf. Commun. Control Comput.<\/em>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=35921747-b091-4da7-a296-06bb07812d69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:14:08Z","timestamp":1578428048000},"score":1,"resource":{"primary":{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2015.9.87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2015.9.87","relation":{},"ISSN":["1930-5338"],"issn-type":[{"type":"print","value":"1930-5338"}],"subject":[],"published":{"date-parts":[[2015]]}}}