{"id":"https://openalex.org/W2028643302","doi":"https://doi.org/10.1109/isit.2012.6284281","title":"Reducing complexity of tail-biting trellises","display_name":"Reducing complexity of tail-biting trellises","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2028643302","doi":"https://doi.org/10.1109/isit.2012.6284281","mag":"2028643302"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/A5089040743","display_name":"Heide Gluesing-Luerssen","orcid":"https://orcid.org/0000-0002-2780-192X"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Heide Gluesing-Luerssen","raw_affiliation_strings":["Department of Mathematics, University of Kentucky, Lexington, KY, USA","University of Kentucky, Department of Mathematics Lexington, KY 40506"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kentucky, Lexington, KY, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"University of Kentucky, Department of Mathematics Lexington, KY 40506","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023619541","display_name":"G. David Forney","orcid":"https://orcid.org/0000-0003-1711-5974"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. David Forney","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","Laboratory for Information & Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139;"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"]},{"raw_affiliation_string":"Laboratory for Information & Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139;","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089040743"],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":null,"apc_paid":null,"fwci":0.3369,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60339595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"646","last_page":"650"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9879999756813049,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/irreducibility","display_name":"Irreducibility","score":0.9275332689285278},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.7366071343421936},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.5976743698120117},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.5774551033973694},{"id":"https://openalex.org/keywords/trim","display_name":"Trim","score":0.5523189902305603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5076090097427368},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4111441373825073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4019773304462433},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3457605838775635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30412566661834717},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.23842912912368774},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14188304543495178},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12389245629310608},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11608901619911194},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.0738215446472168}],"concepts":[{"id":"https://openalex.org/C2776823524","wikidata":"https://www.wikidata.org/wiki/Q6073561","display_name":"Irreducibility","level":2,"score":0.9275332689285278},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.7366071343421936},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5976743698120117},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.5774551033973694},{"id":"https://openalex.org/C88611116","wikidata":"https://www.wikidata.org/wiki/Q957004","display_name":"Trim","level":2,"score":0.5523189902305603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5076090097427368},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4111441373825073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4019773304462433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3457605838775635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30412566661834717},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.23842912912368774},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14188304543495178},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12389245629310608},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11608901619911194},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0738215446472168},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2015505811","https://openalex.org/W2100053622","https://openalex.org/W2109914229","https://openalex.org/W2110433946","https://openalex.org/W2139584447","https://openalex.org/W2169834720","https://openalex.org/W3099685613"],"related_works":["https://openalex.org/W1630580488","https://openalex.org/W2007170860","https://openalex.org/W4205838487","https://openalex.org/W4319349750","https://openalex.org/W4320062971","https://openalex.org/W2951407429","https://openalex.org/W4206542901","https://openalex.org/W4246385323","https://openalex.org/W2145139444","https://openalex.org/W1656119201"],"abstract_inverted_index":{"It":[0],"is":[1,13,49],"shown":[2],"that":[3,33],"a":[4,38],"trellis":[5],"realization":[6],"can":[7],"be":[8],"locally":[9],"reduced":[10],"if":[11],"it":[12],"not":[14,24],"state-trim,":[15],"branch-trim,":[16],"proper,":[17],"observable,":[18],"and":[19,40],"controllable.":[20],"These":[21],"conditions":[22],"are":[23],"sufficient":[25,41],"for":[26,46],"local":[27,44],"irreducibility.":[28],"Making":[29],"use":[30],"of":[31,43],"notions":[32],"amount":[34],"to":[35],"\u201calmost":[36],"unobservability/uncontrollability\u201d,":[37],"necessary":[39],"criterion":[42],"irreducibility":[45],"tail-biting":[47],"trellises":[48],"presented.":[50]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}