{"id":"https://openalex.org/W2963373550","doi":"https://doi.org/10.1109/isit.2017.8006803","title":"Greedy-merge degrading has optimal power-law","display_name":"Greedy-merge degrading has optimal power-law","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2963373550","doi":"https://doi.org/10.1109/isit.2017.8006803","mag":"2963373550"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006803","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5038326433","display_name":"Assaf Kartowsky","orcid":"https://orcid.org/0000-0001-7051-8700"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Assaf Kartowsky","raw_affiliation_strings":["Department of Electrical Engineering, Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075380828","display_name":"Ido Tal","orcid":"https://orcid.org/0000-0001-5419-1162"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ido Tal","raw_affiliation_strings":["Department of Electrical Engineering, Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038326433"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.4504,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85523111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1618","last_page":"1622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9984999895095825,"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/merge","display_name":"Merge (version control)","score":0.8271570205688477},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7278196215629578},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6196373701095581},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.4786340296268463},{"id":"https://openalex.org/keywords/mutual-information","display_name":"Mutual information","score":0.467110276222229},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4480642080307007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43258392810821533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4021540880203247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38072431087493896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.373687207698822},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11514231562614441}],"concepts":[{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.8271570205688477},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7278196215629578},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6196373701095581},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.4786340296268463},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.467110276222229},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4480642080307007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43258392810821533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4021540880203247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38072431087493896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.373687207698822},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11514231562614441},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006803","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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":16,"referenced_works":["https://openalex.org/W1979370616","https://openalex.org/W1982392236","https://openalex.org/W2097662584","https://openalex.org/W2107211662","https://openalex.org/W2150498905","https://openalex.org/W2164368671","https://openalex.org/W2170869643","https://openalex.org/W2569093245","https://openalex.org/W2583360924","https://openalex.org/W2613731764","https://openalex.org/W2743468086","https://openalex.org/W2962702487","https://openalex.org/W2962887023","https://openalex.org/W2963373550","https://openalex.org/W4250589301","https://openalex.org/W6732897755"],"related_works":["https://openalex.org/W1997715509","https://openalex.org/W2356015003","https://openalex.org/W2074050947","https://openalex.org/W1838431648","https://openalex.org/W2156833550","https://openalex.org/W2006931095","https://openalex.org/W2060029658","https://openalex.org/W4237134732","https://openalex.org/W1594272482","https://openalex.org/W2165167056"],"abstract_inverted_index":{"Consider":[0],"a":[1,4,15,61],"channel":[2,16],"with":[3,17],"given":[5],"input":[6,45,50],"distribution.":[7],"Our":[8],"aim":[9],"is":[10,27,59,74],"to":[11,14],"degrade":[12],"it":[13],"at":[18],"most":[19],"L":[20],"output":[21],"letters.":[22],"One":[23],"such":[24],"degradation":[25],"method":[26],"the":[28,39,56,77],"so":[29],"called":[30],"\u201cgreedy-merge\u201d":[31],"algorithm.":[32],"We":[33],"derive":[34],"an":[35,65],"upper":[36,57],"bound":[37,58],"on":[38],"reduction":[40],"in":[41,76],"mutual":[42],"information":[43],"between":[44],"and":[46,53],"output.":[47],"For":[48],"fixed":[49],"alphabet":[51],"size":[52],"variable":[54],"L,":[55],"within":[60],"constant":[62],"factor":[63],"of":[64],"algorithm-independent":[66],"lower":[67],"bound.":[68],"Thus,":[69],"we":[70],"establish":[71],"that":[72],"greedy-merge":[73],"optimal":[75],"power-law":[78],"sense.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}