{"id":"https://openalex.org/W2928447401","doi":"https://doi.org/10.1109/itw.2002.1115436","title":"The minimum average code for finite memoryless monotone sources","display_name":"The minimum average code for finite memoryless monotone sources","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W2928447401","doi":"https://doi.org/10.1109/itw.2002.1115436","mag":"2928447401"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2002.1115436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2002.1115436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the IEEE Information Theory Workshop","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/A5090381199","display_name":"Mohammadali Khosravifard","orcid":"https://orcid.org/0000-0002-0645-7285"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Khosravifard","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035133764","display_name":"T. Aaron Gulliver","orcid":"https://orcid.org/0000-0001-9919-0323"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"T.A. Gulliver","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102939042","display_name":"Morteza Esmaeili","orcid":"https://orcid.org/0000-0002-8894-7017"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Esmaeili","raw_affiliation_strings":["Dept. of Math. Sciences, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Math. Sciences, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052141236","display_name":"Hossein Saidi","orcid":"https://orcid.org/0000-0002-9568-0760"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Saidi","raw_affiliation_strings":["Dept. of Electrical & Computer Eng., Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Eng., Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9377,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83267374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"135","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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.9973999857902527,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9919000267982483,"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/mathematics","display_name":"Mathematics","score":0.7544530630111694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6176860332489014},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5849409103393555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5808517932891846},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5387414693832397},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.5128791332244873},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4924531877040863},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48518994450569153},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.48437342047691345},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.4273507595062256},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19819095730781555},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.1705307960510254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1670919954776764},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14112332463264465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10955330729484558},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09085303544998169}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7544530630111694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6176860332489014},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5849409103393555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5808517932891846},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5387414693832397},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.5128791332244873},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4924531877040863},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48518994450569153},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.48437342047691345},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4273507595062256},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19819095730781555},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.1705307960510254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1670919954776764},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14112332463264465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10955330729484558},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09085303544998169},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2002.1115436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2002.1115436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4699999988079071,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1578978375","https://openalex.org/W1585125654","https://openalex.org/W1975489634","https://openalex.org/W1993742159","https://openalex.org/W2001385273","https://openalex.org/W2002661259","https://openalex.org/W2004985727","https://openalex.org/W2016003972","https://openalex.org/W2058215732","https://openalex.org/W2060108852","https://openalex.org/W2076803615","https://openalex.org/W2079967417","https://openalex.org/W2083324355","https://openalex.org/W2083368438","https://openalex.org/W2084127117","https://openalex.org/W2103198064","https://openalex.org/W2107745473","https://openalex.org/W2110084720","https://openalex.org/W2111098540","https://openalex.org/W2116045215","https://openalex.org/W2128777897","https://openalex.org/W2148574462","https://openalex.org/W2159381752","https://openalex.org/W2169389509","https://openalex.org/W2170352625","https://openalex.org/W2186207288","https://openalex.org/W2572539223","https://openalex.org/W2913251172","https://openalex.org/W2928447401","https://openalex.org/W4239450123","https://openalex.org/W4242970175"],"related_works":["https://openalex.org/W2141317899","https://openalex.org/W4312409941","https://openalex.org/W4296567424","https://openalex.org/W1969741585","https://openalex.org/W2025454449","https://openalex.org/W3143996415","https://openalex.org/W2167474439","https://openalex.org/W2078591209","https://openalex.org/W2159205125","https://openalex.org/W2964279123"],"abstract_inverted_index":{"In":[0],"this":[1,27],"paper,":[2],"the":[3,17,36,40,78,106,121],"average":[4,41],"probability":[5],"distribution":[6,28],"P~/sup":[7],"N/~":[8],"of":[9,19,26,77,123],"equiprobable":[10],"finite":[11],"monotone":[12],"sources,":[13],"where":[14],"N":[15,54],"is":[16,21,48,57,64,125],"number":[18,122],"symbols,":[20],"derived":[22],"and":[23,61,101,109],"some":[24],"properties":[25,114],"are":[29,115],"investigated.":[30],"The":[31,75],"associated":[32],"Huffman":[33],"code":[34],"has":[35],"minimum":[37],"redundancy":[38],"in":[39,69],"sense.":[42],"An":[43],"efficient":[44],"suboptimal":[45],"encoding":[46],"technique":[47],"proposed.":[49],"We":[50],"show":[51],"that":[52,85],"log":[53],"-H(P~/sup":[55],"N/~)":[56],"a":[58,65,71,97],"constant":[59,98],"asymptotically,":[60],"consequently":[62],"there":[63],"negligible":[66],"penalty":[67],"(asymptotically)":[68],"using":[70],"fixed":[72],"length":[73,76],"code.":[74],"shortest":[79],"codeword":[80],"should":[81],"be":[82,96],"modified":[83],"such":[84,104],"lim/sub":[86],"N/spl":[87],"rarr//spl":[88],"infin//":[89],"l/sub":[90],"N//l/sub":[91],"1/=2.":[92],"This":[93],"limit":[94],"cannot":[95],"for":[99],"minimax":[100],"universal":[102],"codes":[103],"as":[105],"/spl":[107,110],"omega/":[108],"delta/":[111],"codes.":[112],"These":[113],"also":[116],"shown":[117],"to":[118],"hold":[119],"when":[120],"symbols":[124],"unknown":[126],"but":[127],"bounded.":[128]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}