{"id":"https://openalex.org/W2090185533","doi":"https://doi.org/10.1109/isit.2014.6875105","title":"Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus","display_name":"Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2090185533","doi":"https://doi.org/10.1109/isit.2014.6875105","mag":"2090185533"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875105","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028154201","display_name":"Pascal O. Vontobel","orcid":"https://orcid.org/0000-0002-6180-258X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH","US"],"is_corresponding":true,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland","[Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA]","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028154201"],"corresponding_institution_ids":["https://openalex.org/I35440088","https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10425728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1608","last_page":"1612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.679520845413208},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5293275117874146},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5186344981193542},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4688749313354492},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45094773173332214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4376939535140991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43652236461639404},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.42180556058883667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3873263895511627},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38193362951278687}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.679520845413208},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5293275117874146},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5186344981193542},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4688749313354492},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45094773173332214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4376939535140991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43652236461639404},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.42180556058883667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3873263895511627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38193362951278687},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6875105","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332603","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1488574293","https://openalex.org/W1795198283","https://openalex.org/W1830631662","https://openalex.org/W1969880716","https://openalex.org/W1970851820","https://openalex.org/W2026046480","https://openalex.org/W2053382619","https://openalex.org/W2086564526","https://openalex.org/W2112593200","https://openalex.org/W2137813581","https://openalex.org/W2138628599","https://openalex.org/W2150859678","https://openalex.org/W2155622784","https://openalex.org/W2171516545","https://openalex.org/W2395283504","https://openalex.org/W2566505556","https://openalex.org/W3106495992","https://openalex.org/W4301306967","https://openalex.org/W6638138353","https://openalex.org/W6638770648","https://openalex.org/W6648920403"],"related_works":["https://openalex.org/W24774503","https://openalex.org/W2014821076","https://openalex.org/W3166204570","https://openalex.org/W3121246613","https://openalex.org/W2132137594","https://openalex.org/W1990620319","https://openalex.org/W1965744717","https://openalex.org/W2093537624","https://openalex.org/W2111234595","https://openalex.org/W1687551056"],"abstract_inverted_index":{"Motivated":[0],"by":[1,38,51,61],"coding-theoretic":[2],"questions":[3],"that":[4,27,31],"arise":[5],"in":[6],"the":[7,15,20,48,53,57,63,66,74,85,88,93],"context":[8],"of":[9,17,22,24,56],"flash-memory-based":[10],"data":[11],"storage,":[12],"we":[13],"consider":[14],"problem":[16],"(approximately)":[18],"counting":[19,84,90],"number":[21],"sequences":[23],"length":[25],"n":[26],"are":[28,80],"balanced":[29],"and":[30,60,69],"avoid":[32],"certain":[33],"patterns.":[34],"We":[35],"do":[36],"this":[37],"formulating":[39],"a":[40],"suitable":[41],"factor":[42],"graph":[43],"whose":[44],"total":[45,58,67],"sum":[46,68],"represents":[47],"desired":[49],"quantity,":[50],"computing":[52],"Bethe":[54,71],"approximation":[55,72],"sum,":[59],"bounding":[62],"difference":[64],"between":[65],"its":[70],"via":[73],"loop":[75],"calculus":[76],"technique.":[77],"Although":[78],"there":[79],"alternative":[81],"techniques":[82],"for":[83],"above-mentioned":[86],"sequences,":[87],"presented":[89],"technique":[91],"has":[92],"potential":[94],"to":[95,99],"generalize":[96],"more":[97],"easily":[98],"other":[100],"setups.":[101]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}