{"id":"https://openalex.org/W2035233912","doi":"https://doi.org/10.1109/isit.2007.4557234","title":"Context Quantization by Minimum Adaptive Code Length","display_name":"Context Quantization by Minimum Adaptive Code Length","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2035233912","doi":"https://doi.org/10.1109/isit.2007.4557234","mag":"2035233912"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/492d3d45-bf92-48d4-a22f-543d4f8cc415","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019279820","display_name":"S\u00f8ren Forchhammer","orcid":"https://orcid.org/0000-0002-6698-8870"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Soren Forchhammer","raw_affiliation_strings":["COM Department, Technical University of Denmark, Kongens Lyngby, Denmark","Tech. Univ. of Denmark, Lyngby"],"affiliations":[{"raw_affiliation_string":"COM Department, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Tech. Univ. of Denmark, Lyngby","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101467563","display_name":"Xiaolin Wu","orcid":"https://orcid.org/0000-0002-7230-9168"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Xiaolin Wu","raw_affiliation_strings":["Department Electrical and Computer Engineering, McMaster University, Hamilton, ONT, Canada","Dept. Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada L8G 4M2. xwu@mail.ece.mcmaster.ca"],"affiliations":[{"raw_affiliation_string":"Department Electrical and Computer Engineering, McMaster University, Hamilton, ONT, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"Dept. Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada L8G 4M2. xwu@mail.ece.mcmaster.ca","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019279820"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.6575,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.71312427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":null,"first_page":"246","last_page":"250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9941999912261963,"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.9861999750137329,"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/quantization","display_name":"Quantization (signal processing)","score":0.5808032751083374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5253212451934814},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5235973596572876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5158026218414307},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4756224453449249},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4713171124458313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4660293757915497},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.4642295241355896},{"id":"https://openalex.org/keywords/context-model","display_name":"Context model","score":0.45438680052757263},{"id":"https://openalex.org/keywords/entropy-encoding","display_name":"Entropy encoding","score":0.43368443846702576},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4187999963760376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40821802616119385},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.271424800157547},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.2296200692653656},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20834389328956604},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11982473731040955}],"concepts":[{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.5808032751083374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5253212451934814},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5235973596572876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5158026218414307},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4756224453449249},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4713171124458313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4660293757915497},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.4642295241355896},{"id":"https://openalex.org/C183322885","wikidata":"https://www.wikidata.org/wiki/Q17007702","display_name":"Context model","level":3,"score":0.45438680052757263},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.43368443846702576},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40821802616119385},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.271424800157547},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2296200692653656},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20834389328956604},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11982473731040955},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2007.4557234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/492d3d45-bf92-48d4-a22f-543d4f8cc415","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/492d3d45-bf92-48d4-a22f-543d4f8cc415","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Forchhammer , S &amp; Wu , X 2007 , Context quantization by minimum adaptive code length . in IEEE International Symposium on Information Theory, 2007. ISIT 2007. . IEEE , Nice, France , pp. 246-250 , 2007 IEEE International Symposium on Information Theory , Nice , France , 24/06/2007 . https://doi.org/10.1109/ISIT.2007.4557234","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/492d3d45-bf92-48d4-a22f-543d4f8cc415","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/492d3d45-bf92-48d4-a22f-543d4f8cc415","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Forchhammer , S &amp; Wu , X 2007 , Context quantization by minimum adaptive code length . in IEEE International Symposium on Information Theory, 2007. ISIT 2007. . IEEE , Nice, France , pp. 246-250 , 2007 IEEE International Symposium on Information Theory , Nice , France , 24/06/2007 . https://doi.org/10.1109/ISIT.2007.4557234","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2027973753","https://openalex.org/W2032066785","https://openalex.org/W2082967074","https://openalex.org/W2095748386","https://openalex.org/W2095963120","https://openalex.org/W2121585122","https://openalex.org/W2132573196","https://openalex.org/W2136774480","https://openalex.org/W2137923603","https://openalex.org/W2151308902","https://openalex.org/W2153638435","https://openalex.org/W2163294786","https://openalex.org/W6677855677"],"related_works":["https://openalex.org/W4298831272","https://openalex.org/W2100554350","https://openalex.org/W2485286452","https://openalex.org/W2169171042","https://openalex.org/W2181722884","https://openalex.org/W1639245444","https://openalex.org/W4205431428","https://openalex.org/W1563071474","https://openalex.org/W2141918107","https://openalex.org/W3021307491"],"abstract_inverted_index":{"Context":[0],"quantization":[1,71],"is":[2,40,55,62,67,72],"a":[3,80],"technique":[4],"to":[5],"deal":[6],"with":[7],"the":[8,20,27,87],"issue":[9],"of":[10,22,29,36,89],"context":[11,23,38,47,70,90],"dilution":[12],"in":[13,74,86],"high-order":[14],"conditional":[15],"entropy":[16],"coding.":[17],"We":[18],"investigate":[19],"problem":[21],"quantizer":[24,48],"design":[25,49],"under":[26],"criterion":[28],"minimum":[30],"adaptive":[31],"code":[32],"length.":[33],"A":[34,45],"property":[35],"such":[37],"quantizers":[39],"derived":[41],"for":[42,51],"binary":[43,53],"symbols.":[44],"fast":[46],"algorithm":[50,66],"conditioning":[52],"symbols":[54],"presented":[56],"and":[57],"its":[58],"complexity":[59],"analyzed.":[60],"It":[61],"conjectured":[63],"that":[64],"this":[65],"optimal.":[68],"The":[69],"performed":[73],"what":[75],"may":[76],"be":[77],"perceived":[78],"as":[79],"probability":[81],"simplex":[82],"space":[83,88],"rather":[84],"than":[85],"instances.":[91]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
