{"id":"https://openalex.org/W2027772097","doi":"https://doi.org/10.1109/allerton.2013.6736617","title":"Non-asymptotic bounds on fixed length source coding for Markov chains","display_name":"Non-asymptotic bounds on fixed length source coding for Markov chains","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2027772097","doi":"https://doi.org/10.1109/allerton.2013.6736617","mag":"2027772097"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2013.6736617","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5024634142","display_name":"Masahito Hayashi","orcid":"https://orcid.org/0000-0003-3104-1000"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Masahito Hayashi","raw_affiliation_strings":["Graduate School of Mathematics Nagoya University, Japan","Grad. Sch. of Math., Nagoya Univ., Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Mathematics Nagoya University, Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Grad. Sch. of Math., Nagoya Univ., Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045523488","display_name":"Shun Watanabe","orcid":"https://orcid.org/0000-0002-1121-8633"},"institutions":[{"id":"https://openalex.org/I922474255","display_name":"Tokushima University","ror":"https://ror.org/044vy1d05","country_code":"JP","type":"education","lineage":["https://openalex.org/I922474255"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Shun Watanabe","raw_affiliation_strings":["Institute for Systems Research University of Maryland, College Park","Dept. of Inf. Sci. & Intell. Syst., Univ. of Tokushima, Tokushima, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute for Systems Research University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Inf. Sci. & Intell. Syst., Univ. of Tokushima, Tokushima, Japan#TAB#","institution_ids":["https://openalex.org/I922474255"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024634142"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":0.2364,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59799775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"875","last_page":"882"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6976008415222168},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5869848728179932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5418082475662231},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5152023434638977},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4970879852771759},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.48814210295677185},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4628106653690338},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4521881639957428},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4204466938972473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38475501537323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35379332304000854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3289370834827423},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11019769310951233}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6976008415222168},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5869848728179932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5418082475662231},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5152023434638977},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4970879852771759},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48814210295677185},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4628106653690338},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4521881639957428},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4204466938972473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38475501537323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35379332304000854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3289370834827423},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11019769310951233}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2013.6736617","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":30,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1989338245","https://openalex.org/W1990309618","https://openalex.org/W1993944611","https://openalex.org/W1995875735","https://openalex.org/W2013695092","https://openalex.org/W2020347709","https://openalex.org/W2023479037","https://openalex.org/W2041537137","https://openalex.org/W2055055260","https://openalex.org/W2055094761","https://openalex.org/W2104340231","https://openalex.org/W2106864314","https://openalex.org/W2108250525","https://openalex.org/W2134746921","https://openalex.org/W2155973165","https://openalex.org/W2163564240","https://openalex.org/W2167830490","https://openalex.org/W2174534725","https://openalex.org/W2254512934","https://openalex.org/W2276299490","https://openalex.org/W2399816043","https://openalex.org/W2597388719","https://openalex.org/W3101044064","https://openalex.org/W4251984466","https://openalex.org/W4301258660","https://openalex.org/W4302366875","https://openalex.org/W6656224615","https://openalex.org/W6712616863","https://openalex.org/W6785949509"],"related_works":["https://openalex.org/W3203142394","https://openalex.org/W2161474341","https://openalex.org/W4302615923","https://openalex.org/W1974101135","https://openalex.org/W2351061015","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"derive":[4],"non-asymptotic":[5],"bounds":[6,19],"on":[7,33],"the":[8,16,24,27,34,43,46,50],"fixed":[9],"length":[10],"source":[11],"coding":[12],"with/without":[13],"side-information":[14],"at":[15],"decoder.":[17],"Our":[18],"are":[20,38],"efficiently":[21],"computable":[22],"in":[23,42],"sense":[25,44],"that":[26],"computational":[28],"complexity":[29],"does":[30],"not":[31],"depend":[32],"block":[35],"length,":[36],"and":[37],"also":[39],"asymptotically":[40],"optimal":[41],"of":[45],"large":[47],"deviation":[48],"and/or":[49],"moderate":[51],"deviation.":[52]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}