{"id":"https://openalex.org/W2072847621","doi":"https://doi.org/10.1109/isit.2005.1523601","title":"Non prefix-free codes for constrained sequences","display_name":"Non prefix-free codes for constrained sequences","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2072847621","doi":"https://doi.org/10.1109/isit.2005.1523601","mag":"2072847621"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11379/14883","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037433671","display_name":"Marco Dalai","orcid":"https://orcid.org/0000-0003-2132-7072"},"institutions":[{"id":"https://openalex.org/I30667456","display_name":"Brescia University","ror":"https://ror.org/015ahgd08","country_code":"US","type":"education","lineage":["https://openalex.org/I30667456"]},{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT","US"],"is_corresponding":true,"raw_author_name":"M. Dalai","raw_affiliation_strings":["Department of Electronics for Automation, University of Brescia, Italy","[Dept. of Electron. for Autom., Brescia Univ.]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics for Automation, University of Brescia, Italy","institution_ids":["https://openalex.org/I79940851"]},{"raw_affiliation_string":"[Dept. of Electron. for Autom., Brescia Univ.]","institution_ids":["https://openalex.org/I30667456"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077643154","display_name":"Riccardo Leonardi","orcid":"https://orcid.org/0000-0003-0755-1924"},"institutions":[{"id":"https://openalex.org/I30667456","display_name":"Brescia University","ror":"https://ror.org/015ahgd08","country_code":"US","type":"education","lineage":["https://openalex.org/I30667456"]},{"id":"https://openalex.org/I79940851","display_name":"University of Brescia","ror":"https://ror.org/02q2d2610","country_code":"IT","type":"education","lineage":["https://openalex.org/I79940851"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"R. Leonardi","raw_affiliation_strings":["Department of Electronics for Automation, University of Brescia, Italy","[Dept. of Electron. for Autom., Brescia Univ.]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics for Automation, University of Brescia, Italy","institution_ids":["https://openalex.org/I79940851"]},{"raw_affiliation_string":"[Dept. of Electron. for Autom., Brescia Univ.]","institution_ids":["https://openalex.org/I30667456"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037433671"],"corresponding_institution_ids":["https://openalex.org/I30667456","https://openalex.org/I79940851"],"apc_list":null,"apc_paid":null,"fwci":0.6733,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.71975806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"it 7","issue":null,"first_page":"1534","last_page":"1538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"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/prefix","display_name":"Prefix","score":0.682756781578064},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6691642999649048},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5639786720275879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49963808059692383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44997698068618774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4342038035392761},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4146641194820404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39917629957199097},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.375276654958725},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2693299651145935},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22739359736442566},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.1880989968776703},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07622966170310974}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.682756781578064},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6691642999649048},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5639786720275879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49963808059692383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44997698068618774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4342038035392761},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4146641194820404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39917629957199097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.375276654958725},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2693299651145935},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22739359736442566},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.1880989968776703},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07622966170310974},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2005.1523601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unibs.it:11379/14883","is_oa":true,"landing_page_url":"http://hdl.handle.net/11379/14883","pdf_url":"http://hdl.handle.net/11379/14883","source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.331.3324","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ing.unibs.it/~marco.dalai/pub/DL_ISIT05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.3327","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0506036v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:iris.unibs.it:11379/14883","is_oa":true,"landing_page_url":"http://hdl.handle.net/11379/14883","pdf_url":"http://hdl.handle.net/11379/14883","source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.550000011920929,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2072847621.pdf","grobid_xml":"https://content.openalex.org/works/W2072847621.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W285471286","https://openalex.org/W1509016759","https://openalex.org/W1565611252","https://openalex.org/W1880806511","https://openalex.org/W1970091448","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2118375162","https://openalex.org/W2126402106","https://openalex.org/W2139519968","https://openalex.org/W2155676967","https://openalex.org/W2169476932","https://openalex.org/W2947000318","https://openalex.org/W4212873484"],"related_works":["https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W2566439177","https://openalex.org/W2023299357","https://openalex.org/W2136927376","https://openalex.org/W4244214420","https://openalex.org/W2385872287","https://openalex.org/W2374499972","https://openalex.org/W2252414143","https://openalex.org/W2043860853"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,66],"consider":[4],"the":[5,33,38,62,78,103,106],"use":[6,79],"of":[7,17,80,93],"variable":[8],"length":[9],"non":[10,81],"prefix-free":[11,82],"codes":[12,83],"for":[13,58],"coding":[14,112],"constrained":[15],"sequences":[16],"symbols.":[18],"We":[19,45],"suppose":[20],"to":[21],"have":[22],"a":[23,53,68],"Markov":[24,39],"source":[25],"where":[26],"some":[27,42,76],"state":[28],"transitions":[29],"are":[30,100],"impossible,":[31],"i.e.":[32],"stochastic":[34],"matrix":[35],"associated":[36],"with":[37],"chain":[40],"has":[41],"null":[43],"entries.":[44],"show":[46],"that":[47,84],"classic":[48],"Kraft":[49],"inequality":[50,71],"is":[51],"not":[52],"necessary":[54,70],"condition,":[55],"in":[56,75,91],"general,":[57],"unique":[59],"decodability":[60],"under":[61],"above":[63],"hypothesis":[64],"and":[65,95,109],"propose":[67],"relaxed":[69],"condition.":[72],"This":[73],"allows,":[74],"cases,":[77],"can":[85],"give":[86],"very":[87],"good":[88],"performance,":[89],"both":[90],"terms":[92],"compression":[94],"computational":[96],"efficiency.":[97],"Some":[98],"considerations":[99],"made":[101],"on":[102],"relation":[104],"between":[105],"proposed":[107],"approach":[108],"other":[110],"existing":[111],"paradigms":[113]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}