{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:35:54Z","timestamp":1763105754225,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"SERB, DST, Government of India","doi-asserted-by":"publisher","award":["SB\/S3\/EECE\/265\/2016"],"award-info":[{"award-number":["SB\/S3\/EECE\/265\/2016"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tcomm.2020.3040401","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T21:14:53Z","timestamp":1606338893000},"page":"874-883","source":"Crossref","is-referenced-by-count":10,"title":["Recursive Algorithm to Verify Quasi-Uniform Entropy Vectors and its Applications"],"prefix":"10.1109","volume":"69","author":[{"given":"Dauood","family":"Saleem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-0975","authenticated-orcid":false,"given":"Satyajit","family":"Thakor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2627530"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2529643"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280914"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513737"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557096"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513674"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201340"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013138"},{"key":"ref34","first-page":"63","article-title":"A combinatorial approach to information inequalities","author":"chan","year":"1999","journal-title":"Proc Inf Theory Netw Workshop"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447064"},{"key":"ref40","first-page":"1","article-title":"On the entropy region and the Ingleton inequality","author":"fong","year":"2008","journal-title":"Proc Math Theory Netw Syst (MTNS)"},{"key":"ref11","article-title":"Mapping the region of entropic vectors with support enumeration & information geometry","author":"liu","year":"2015","journal-title":"arXiv 1512 03324"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989076"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664232"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3030055"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860438"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404674"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6282169"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989116"},{"key":"ref28","article-title":"Linear rank inequalities on five or more variables","author":"dougherty","year":"2009","journal-title":"arXiv 0910 0284"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref27","first-page":"149","article-title":"Representation of matroids","author":"ingleton","year":"1971","journal-title":"Combinatorial Mathematics and its Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)80004-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001644"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.10.014"},{"key":"ref5","article-title":"Non-Shannon information inequalities in four random variables","author":"dougherty","year":"2011","journal-title":"arXiv 1104 3602"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003740"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165817"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557201"},{"article-title":"Entropy region and network information theory","year":"2011","author":"shadbakht","key":"ref22"},{"journal-title":"Information Theory and Network Coding","year":"2008","author":"yeung","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2600580"},{"journal-title":"Algorithm Design","year":"2005","author":"kleinberg","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"journal-title":"Error-Correcting Linear Codes Classification by Isometry and Applications (Algorithms and Computation in Mathematics)","year":"2006","author":"betten","key":"ref26"},{"key":"ref25","article-title":"Constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding","author":"apte","year":"2016","journal-title":"arXiv 1605 04598"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9355073\/09269992.pdf?arnumber=9269992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:48Z","timestamp":1652194128000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9269992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3040401","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}