{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T11:09:21Z","timestamp":1725448161097},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875105","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"1608-1612","source":"Crossref","is-referenced-by-count":0,"title":["Counting balanced sequencesw\/o forbidden patterns via the betheapproximation and loop calculus"],"prefix":"10.1109","author":[{"given":"Pascal O.","family":"Vontobel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"Loop calculus for non-binary alphabets using concepts of information geometry","author":"mori","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"18","article-title":"The Bethe free energy allows to compute the conditional entropy of graphical code instances, A proof from the polymer expansion","author":"macris","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094870"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557245"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06009"},{"key":"14","article-title":"Partition functions of normal factor graphs","author":"forney jr","year":"2011","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140504"},{"key":"2","article-title":"Perspectives on balanced sequences","author":"weber","year":"2013","journal-title":"CoRR"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033936"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284033"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122211.110026"},{"journal-title":"The On-Line Encycl of Integer Sequences","year":"0","key":"4"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21696-6_16","article-title":"On factor graphs and electrical networks","author":"vontobel","year":"2003","journal-title":"Mathematical Systems Theory in Biology Communication Computation and Finance IMA Volumes in Math & Appl"},{"journal-title":"Counting Balanced Sequences W\/o Forbidden Patterns via the Bethe Approximation and Loop Calculus (Extended Version)","year":"2014","author":"vontobel","key":"8"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875105.pdf?arnumber=6875105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:25:01Z","timestamp":1602689101000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875105","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}