{"id":"https://openalex.org/W2000287463","doi":"https://doi.org/10.1109/isit.2014.6875156","title":"A parallel two-pass MDL context tree algorithm for universal source coding","display_name":"A parallel two-pass MDL context tree algorithm for universal source coding","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2000287463","doi":"https://doi.org/10.1109/isit.2014.6875156","mag":"2000287463"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875156","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/A5053565922","display_name":"Nikhil Krishnan","orcid":"https://orcid.org/0000-0002-3755-6120"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Krishnan","raw_affiliation_strings":["Department of Electrical and Computer Engineering","Dept. of Electr. & Comput. Eng, North Carolina State Univ., Raleigh, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering","institution_ids":[]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, North Carolina State Univ., Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037316256","display_name":"Dror Baron","orcid":"https://orcid.org/0000-0002-6371-8496"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dror Baron","raw_affiliation_strings":["Department of Electrical and Computer Engineering","Dept. of Electr. & Comput. Eng, North Carolina State Univ., Raleigh, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering","institution_ids":[]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, North Carolina State Univ., Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112447409","display_name":"M. K\u0131van\u00e7 M\u0131h\u00e7ak","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehmet Kivanc Mihcak","raw_affiliation_strings":["Microsoft (United States), Redmond, United States"],"affiliations":[{"raw_affiliation_string":"Microsoft (United States), Redmond, United States","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053565922"],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":null,"apc_paid":null,"fwci":1.6361,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86816558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1862","last_page":"1866"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9908000230789185,"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.988099992275238,"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/lossless-compression","display_name":"Lossless compression","score":0.7003260850906372},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.6543936729431152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6077468395233154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5629903674125671},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5206360220909119},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5077136754989624},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4753422737121582},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4746730327606201},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.46186715364456177},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4338448941707611},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.41347646713256836},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.37659692764282227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3549595773220062},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.2592483162879944}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.7003260850906372},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.6543936729431152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6077468395233154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5629903674125671},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5206360220909119},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5077136754989624},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4753422737121582},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4746730327606201},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.46186715364456177},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4338448941707611},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.41347646713256836},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.37659692764282227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3549595773220062},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.2592483162879944},{"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.2014.6875156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875156","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W86319254","https://openalex.org/W1996187850","https://openalex.org/W2054658115","https://openalex.org/W2068782468","https://openalex.org/W2099111195","https://openalex.org/W2106084391","https://openalex.org/W2114257671","https://openalex.org/W2121999425","https://openalex.org/W2122675611","https://openalex.org/W2148844225","https://openalex.org/W2154605789","https://openalex.org/W2163294786","https://openalex.org/W2478708596","https://openalex.org/W2808343414","https://openalex.org/W2809009512","https://openalex.org/W2809627566","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W6675937107","https://openalex.org/W6677953186","https://openalex.org/W6752446581","https://openalex.org/W6752603504","https://openalex.org/W6752814902"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W2156106714","https://openalex.org/W1579872668","https://openalex.org/W2123072960","https://openalex.org/W1994532706","https://openalex.org/W1914492973","https://openalex.org/W1571321636","https://openalex.org/W2129652681","https://openalex.org/W4393034742","https://openalex.org/W2361854373"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,40],"novel":[3],"lossless":[4],"universal":[5,118],"source":[6,61,126],"coding":[7,119],"algorithm":[8,97],"that":[9],"uses":[10],"parallel":[11,75,92],"computational":[12,102],"units":[13,93],"to":[14,53,123],"increase":[15],"the":[16,32,37,46,56,63,71,78,85],"throughput.":[17],"The":[18],"length-N":[19],"input":[20],"sequence":[21],"is":[22,52,94,98,104,108,130],"partitioned":[23],"into":[24],"B":[25,72,110],"blocks.":[26],"Processing":[27],"each":[28,69],"block":[29],"independently":[30],"of":[31,42,70],"other":[33],"blocks":[34,73],"can":[35],"accelerate":[36],"computation":[38],"by":[39,89],"factor":[41],"B,":[43],"but":[44],"degrades":[45],"compression":[47,86],"quality.":[48],"Instead,":[49],"our":[50],"approach":[51],"first":[54],"estimate":[55],"minimum":[57],"description":[58],"length":[59],"(MDL)":[60],"underlying":[62],"entire":[64],"input,":[65],"and":[66],"then":[67],"encode":[68],"in":[74],"based":[76],"on":[77,117],"MDL":[79],"source.":[80],"With":[81],"this":[82],"two-pass":[83],"approach,":[84],"loss":[87],"incurred":[88],"using":[90],"more":[91],"insignificant.":[95],"Our":[96],"work-efficient,":[99],"i.e.,":[100],"its":[101],"complexity":[103],"O(N=B).":[105],"Its":[106],"redundancy":[107],"approximately":[109],"log(N=B)":[111],"bits":[112],"above":[113],"Rissanen's":[114],"lower":[115],"bound":[116],"performance,":[120],"with":[121],"respect":[122],"any":[124],"tree":[125],"whose":[127],"maximal":[128],"depth":[129],"at":[131],"most":[132],"log(N=B).":[133]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}