{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:48:16Z","timestamp":1753886896639,"version":"3.41.2"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T00:00:00Z","timestamp":1330214400000},"content-version":"vor","delay-in-days":56,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>The computation of channel capacity is a classical issue in information theory. We prove that algorithms based on self\u2010concordant functions can be used to deal with such issues, especially when constrains are included. A new algorithm to compute the channel capacity per unit cost is proposed. The same view is suited to the computation of maximum entropy. All the algorithms are of polynomial time.<\/jats:p>","DOI":"10.1155\/2012\/318946","type":"journal-article","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:59Z","timestamp":1330291739000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computation of Channel Capacity Based on Self\u2010Concordant Functions"],"prefix":"10.1155","volume":"2012","author":[{"given":"Da-gang","family":"Tian","sequence":"first","affiliation":[]},{"given":"Yi-qun","family":"Huang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,2,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_6_1_2","DOI":"10.1109\/TIT.2003.822581"},{"doi-asserted-by":"publisher","key":"e_1_2_6_2_2","DOI":"10.1007\/BF01448363"},{"doi-asserted-by":"publisher","key":"e_1_2_6_3_2","DOI":"10.1109\/TIT.2007.915703"},{"doi-asserted-by":"publisher","key":"e_1_2_6_4_2","DOI":"10.1109\/TIT.1972.1054753"},{"doi-asserted-by":"publisher","key":"e_1_2_6_5_2","DOI":"10.1109\/TIT.1972.1054855"},{"unstructured":"DupuisF. YuW. andWillemsF. M. J. Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information Proceedings of IEEE International Symposium on Information Theory July 2004 2-s2.0-5044242659.","key":"e_1_2_6_6_2"},{"doi-asserted-by":"publisher","key":"e_1_2_6_7_2","DOI":"10.1109\/TIT.2010.2048452"},{"key":"e_1_2_6_8_2","first-page":"205","article-title":"Information geometry and alternating minimization procedures","author":"Csiszar I.","year":"1984","journal-title":"Statistics and Decisions"},{"doi-asserted-by":"publisher","key":"e_1_2_6_9_2","DOI":"10.1109\/TIT.2008.2011442"},{"doi-asserted-by":"publisher","key":"e_1_2_6_10_2","DOI":"10.1109\/72.143375"},{"doi-asserted-by":"publisher","key":"e_1_2_6_11_2","DOI":"10.1137\/080724265"},{"volume-title":"Information Theory and Network Coding","year":"2008","author":"Yeung R. W.","key":"e_1_2_6_12_2"},{"doi-asserted-by":"publisher","key":"e_1_2_6_13_2","DOI":"10.1109\/18.490550"},{"doi-asserted-by":"publisher","key":"e_1_2_6_14_2","DOI":"10.1109\/18.841196"},{"doi-asserted-by":"publisher","key":"e_1_2_6_15_2","DOI":"10.1109\/18.57201"},{"doi-asserted-by":"publisher","key":"e_1_2_6_16_2","DOI":"10.1137\/1.9781611970791"},{"doi-asserted-by":"publisher","key":"e_1_2_6_17_2","DOI":"10.1137\/1.9780898718812"},{"doi-asserted-by":"publisher","key":"e_1_2_6_18_2","DOI":"10.1007\/BF02579150"},{"doi-asserted-by":"publisher","key":"e_1_2_6_19_2","DOI":"10.1017\/CBO9780511804441"},{"unstructured":"LavR. Varshney Variations On Channel Capacity per Unit Cost 2005 http:\/\/web.mit.edu\/lrv\/www\/writing\/cap_cost.pdf.","key":"e_1_2_6_20_2"},{"doi-asserted-by":"publisher","key":"e_1_2_6_21_2","DOI":"10.1214\/08-PS141"},{"doi-asserted-by":"crossref","unstructured":"KleinerM.andRimoldiB. On fidelity per unit cost IEEE International Symposium on Information Theory (ISIT \u203209) July 2009 1639\u20131643 2-s2.0-70449463243 https:\/\/doi.org\/10.1109\/ISIT.2009.5205793.","key":"e_1_2_6_22_2","DOI":"10.1109\/ISIT.2009.5205793"},{"doi-asserted-by":"publisher","key":"e_1_2_6_23_2","DOI":"10.4153\/CJM-2005-049-6"},{"key":"e_1_2_6_24_2","first-page":"1217","article-title":"Maximum entropy density estimation with generalized regularization and an application to species distribution modeling","volume":"8","author":"Dud\u00edk M.","year":"2007","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_2_6_25_2","DOI":"10.1080\/07474930801960394"},{"doi-asserted-by":"publisher","key":"e_1_2_6_26_2","DOI":"10.1214\/aoms\/1177692379"},{"unstructured":"LiangG. YuB. andTaftN. Maximum entropy models: convergence rates and applications in dynamic system monitoring Proceedings of IEEE International Symposium on Information Theory July 2004 168\u2013175 2-s2.0-5044246272.","key":"e_1_2_6_27_2"},{"unstructured":"NigamK. LaffertyJ. andMccallumA. Using maximum entropy for text classification the Workshop on Machine Learning for Information Filtering (IJCAI \u203299) 1999 61\u201367.","key":"e_1_2_6_28_2"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/318946.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/318946.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/318946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T12:17:33Z","timestamp":1718194653000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/318946"}},"subtitle":[],"editor":[{"given":"Tamal","family":"Bose","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/318946"],"URL":"https:\/\/doi.org\/10.1155\/2012\/318946","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"type":"print","value":"2090-0147"},{"type":"electronic","value":"2090-0155"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-07-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"318946"}}