{"id":"https://openalex.org/W2792852228","doi":"https://doi.org/10.1109/tit.2018.2799629","title":"Optimal Golomb-Rice Code Extension for Lossless Coding of Low-Entropy Exponentially Distributed Sources","display_name":"Optimal Golomb-Rice Code Extension for Lossless Coding of Low-Entropy Exponentially Distributed Sources","publication_year":2018,"publication_date":"2018-01-30","ids":{"openalex":"https://openalex.org/W2792852228","doi":"https://doi.org/10.1109/tit.2018.2799629","mag":"2792852228"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2018.2799629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2018.2799629","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5103257295","display_name":"Ryosuke Sugiura","orcid":"https://orcid.org/0000-0002-9464-2527"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryosuke Sugiura","raw_affiliation_strings":["NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan"],"raw_orcid":"https://orcid.org/0000-0002-9464-2527","affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029262432","display_name":"Yutaka Kamamoto","orcid":"https://orcid.org/0000-0001-6578-9178"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yutaka Kamamoto","raw_affiliation_strings":["NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan"],"raw_orcid":"https://orcid.org/0000-0001-6578-9178","affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054467679","display_name":"Noboru Harada","orcid":"https://orcid.org/0000-0002-1759-4533"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Noboru Harada","raw_affiliation_strings":["NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076091643","display_name":"Takehiro Moriya","orcid":"https://orcid.org/0000-0003-4591-1273"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takehiro Moriya","raw_affiliation_strings":["NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Laboratories, Nippon Telegraph and Telephone Corporation, Atsugi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2251713219"],"apc_list":null,"apc_paid":null,"fwci":2.9483,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92825545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"64","issue":"4","first_page":"3153","last_page":"3161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.8527028560638428},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.7977259159088135},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.7423022389411926},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.7235079407691956},{"id":"https://openalex.org/keywords/entropy-encoding","display_name":"Entropy encoding","score":0.6598676443099976},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.6514310836791992},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5657005906105042},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.5648233890533447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5312020182609558},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.5140053033828735},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.5056252479553223},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.5016305446624756},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.499469518661499},{"id":"https://openalex.org/keywords/shannons-source-coding-theorem","display_name":"Shannon's source coding theorem","score":0.4890976548194885},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.4884256422519684},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4864072799682617},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.47213679552078247},{"id":"https://openalex.org/keywords/golomb-coding","display_name":"Golomb coding","score":0.4534561336040497},{"id":"https://openalex.org/keywords/context-adaptive-variable-length-coding","display_name":"Context-adaptive variable-length coding","score":0.44389021396636963},{"id":"https://openalex.org/keywords/entropy-rate","display_name":"Entropy rate","score":0.4360365867614746},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.43303272128105164},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3663599193096161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35505127906799316},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3417760133743286},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.3297531008720398},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.28357017040252686},{"id":"https://openalex.org/keywords/binary-entropy-function","display_name":"Binary entropy function","score":0.22014448046684265},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2145838439464569},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.18325790762901306},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15089702606201172},{"id":"https://openalex.org/keywords/maximum-entropy-thermodynamics","display_name":"Maximum entropy thermodynamics","score":0.10409551858901978},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07576325535774231},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07478412985801697},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07014593482017517}],"concepts":[{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.8527028560638428},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.7977259159088135},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.7423022389411926},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.7235079407691956},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.6598676443099976},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.6514310836791992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5657005906105042},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.5648233890533447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5312020182609558},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.5140053033828735},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.5056252479553223},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.5016305446624756},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.499469518661499},{"id":"https://openalex.org/C177409962","wikidata":"https://www.wikidata.org/wiki/Q2411312","display_name":"Shannon's source coding theorem","level":5,"score":0.4890976548194885},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.4884256422519684},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4864072799682617},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.47213679552078247},{"id":"https://openalex.org/C66656319","wikidata":"https://www.wikidata.org/wiki/Q2638","display_name":"Golomb coding","level":5,"score":0.4534561336040497},{"id":"https://openalex.org/C135534801","wikidata":"https://www.wikidata.org/wiki/Q1128721","display_name":"Context-adaptive variable-length coding","level":4,"score":0.44389021396636963},{"id":"https://openalex.org/C125252325","wikidata":"https://www.wikidata.org/wiki/Q1345213","display_name":"Entropy rate","level":4,"score":0.4360365867614746},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.43303272128105164},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3663599193096161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35505127906799316},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3417760133743286},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.3297531008720398},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.28357017040252686},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.22014448046684265},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2145838439464569},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.18325790762901306},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15089702606201172},{"id":"https://openalex.org/C49775889","wikidata":"https://www.wikidata.org/wiki/Q6795896","display_name":"Maximum entropy thermodynamics","level":4,"score":0.10409551858901978},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07576325535774231},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07478412985801697},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07014593482017517},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C13481523","wikidata":"https://www.wikidata.org/wiki/Q412438","display_name":"Image compression","level":4,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2018.2799629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2018.2799629","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W173675424","https://openalex.org/W319968770","https://openalex.org/W788498898","https://openalex.org/W1537803653","https://openalex.org/W1545139949","https://openalex.org/W1556291985","https://openalex.org/W1580101844","https://openalex.org/W1969805922","https://openalex.org/W1974042972","https://openalex.org/W2044125620","https://openalex.org/W2068290903","https://openalex.org/W2075126280","https://openalex.org/W2075182043","https://openalex.org/W2096988021","https://openalex.org/W2115613939","https://openalex.org/W2129159998","https://openalex.org/W2131499030","https://openalex.org/W2132745210","https://openalex.org/W2133231636","https://openalex.org/W2152828142","https://openalex.org/W2157700496","https://openalex.org/W2161942198","https://openalex.org/W2232701305","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W6607108458","https://openalex.org/W6669491803","https://openalex.org/W6674838261"],"related_works":["https://openalex.org/W2886619161","https://openalex.org/W4250402636","https://openalex.org/W2082705204","https://openalex.org/W2377508920","https://openalex.org/W2176596399","https://openalex.org/W4245351974","https://openalex.org/W2533621910","https://openalex.org/W2964219554","https://openalex.org/W2231051939","https://openalex.org/W2792852228"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"extension":[4],"of":[5,54,66,95,113],"GolombRice":[6],"(GR)":[7],"code":[8,23,48,83],"for":[9,148],"coding":[10,105,150],"low-entropy":[11],"sources,":[12],"which":[13,152],"the":[14,20,30,36,52,75,78,93,96,109,120,130],"gap":[15,76],"between":[16,77],"their":[17],"entropy":[18,79,94],"and":[19,80,103,139],"conventional":[21],"GR":[22,40,114],"length":[24,58,84],"gets":[25],"larger.":[26],"We":[27],"mention":[28],"here":[29],"following":[31],"four":[32],"facts":[33],"related":[34],"to":[35,88,101,108,145],"proposed":[37,133],"code,":[38,115,135],"extended-domain":[39],"(XDGR)":[41],"code:":[42],"it":[43],"is":[44,85,143],"represented":[45],"by":[46],"multiple":[47],"trees,":[49],"based":[50],"on":[51],"idea":[53],"almost":[55],"instantaneous":[56],"fixed-to-variable":[57],"codes,":[59],"with":[60,154],"its":[61,69,81,104],"algorithm":[62,138],"being":[63],"a":[64],"generalization":[65],"unary":[67],"coding;":[68,74],"structure":[70],"naturally":[71],"contains":[72],"run-length":[73],"average":[82],"theoretically":[86],"guaranteed":[87],"be":[89,117,146],"asymptotically":[90],"negligible":[91],"as":[92],"exponentially":[97,155],"distributed":[98,156],"sources":[99,157],"tends":[100],"zero;":[102],"parameter,":[106],"corresponding":[107],"negative-domain":[110],"Rice":[111],"parameter":[112],"can":[116],"estimated":[118],"from":[119],"input":[121],"source-symbol":[122],"sequence.":[123],"Experimental":[124],"evaluations":[125],"are":[126],"also":[127],"presented":[128],"supporting":[129],"theorems.":[131],"The":[132],"XDGR":[134],"having":[136],"simple":[137],"high":[140],"compression":[141],"performance,":[142],"expected":[144],"used":[147],"many":[149],"applications,":[151],"deals":[153],"at":[158],"low":[159],"bit":[160],"rates.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}