{"id":"https://openalex.org/W2150529455","doi":"https://doi.org/10.1109/isit.2009.5205706","title":"Variable length lossy coding using an LDPC code","display_name":"Variable length lossy coding using an LDPC code","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2150529455","doi":"https://doi.org/10.1109/isit.2009.5205706","mag":"2150529455"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5112464181","display_name":"Junya Honda","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Junya Honda","raw_affiliation_strings":["Graduate School of Information Science and Technology, University of Tokyo, Bunkyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, University of Tokyo, Bunkyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084723015","display_name":"H. Yamamoto","orcid":"https://orcid.org/0000-0001-6297-8838"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hirosuke Yamamoto","raw_affiliation_strings":["Graduate School of Frontier Sciences, University of Tokyo, Kashiwa, Chiba, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Frontier Sciences, University of Tokyo, Kashiwa, Chiba, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112464181"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65802361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1973","last_page":"1977"},"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.998199999332428,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.996399998664856,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7435218691825867},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.6753134727478027},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.6416501998901367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6356492638587952},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.552038848400116},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.5347475409507751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506213366985321},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.47411826252937317},{"id":"https://openalex.org/keywords/vector-quantization","display_name":"Vector quantization","score":0.4631248414516449},{"id":"https://openalex.org/keywords/multiple-description-coding","display_name":"Multiple description coding","score":0.4434130787849426},{"id":"https://openalex.org/keywords/context-adaptive-variable-length-coding","display_name":"Context-adaptive variable-length coding","score":0.43846654891967773},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.42626631259918213},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.42383503913879395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3875495195388794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3746139407157898},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.27549582719802856},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09784284234046936}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7435218691825867},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6753134727478027},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.6416501998901367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6356492638587952},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.552038848400116},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.5347475409507751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506213366985321},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.47411826252937317},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.4631248414516449},{"id":"https://openalex.org/C135554599","wikidata":"https://www.wikidata.org/wiki/Q3682206","display_name":"Multiple description coding","level":3,"score":0.4434130787849426},{"id":"https://openalex.org/C135534801","wikidata":"https://www.wikidata.org/wiki/Q1128721","display_name":"Context-adaptive variable-length coding","level":4,"score":0.43846654891967773},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.42626631259918213},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.42383503913879395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3875495195388794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3746139407157898},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.27549582719802856},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09784284234046936}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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":10,"referenced_works":["https://openalex.org/W1965894736","https://openalex.org/W2011442073","https://openalex.org/W2061302090","https://openalex.org/W2114449874","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2160567110","https://openalex.org/W2163118554","https://openalex.org/W2169134868","https://openalex.org/W2293231900"],"related_works":["https://openalex.org/W2148686647","https://openalex.org/W4312628177","https://openalex.org/W2123072960","https://openalex.org/W1579872668","https://openalex.org/W2213686625","https://openalex.org/W1587903609","https://openalex.org/W2668751350","https://openalex.org/W2045024766","https://openalex.org/W3083947873","https://openalex.org/W1548215291"],"abstract_inverted_index":{"LDPC":[0,27,47,57],"codes":[1,28],"initially":[2],"studied":[3],"for":[4,29,95,106],"channel":[5],"coding":[6,89,99,114],"can":[7,21,74,115,123],"be":[8,22],"applied":[9],"to":[10],"source":[11,39],"coding,":[12],"and":[13,49,97],"Miyake-Muramatsu":[14],"showed":[15],"theoretically":[16],"that":[17,71],"the":[18,117,131,137],"rate-distortion":[19,118,138],"function":[20,119],"achieved":[23],"asymptotically":[24],"by":[25,44,55,103],"using":[26,45],"any":[30],"stationary":[31],"memoryless":[32],"finite":[33],"source.":[34],"In":[35,80],"their":[36,60,72],"scheme,":[37,90],"a":[38,76,85,126],"sequence":[40],"is":[41,52,62,68],"first":[42],"vector-quantized":[43],"an":[46],"matrix":[48],"then":[50],"it":[51,67,122],"compressed":[53],"losslessly":[54],"another":[56],"matrix.":[58],"So,":[59],"scheme":[61,73],"fixed":[63],"length":[64,88,112],"coding.":[65,108],"Unfortunately,":[66],"not":[69],"shown":[70],"attain":[75,116,125],"good":[77],"performance":[78,127],"practically.":[79],"this":[81],"paper,":[82],"we":[83],"propose":[84],"new":[86],"variable":[87,111],"which":[91],"uses":[92],"linear":[93],"programming":[94],"vector-quantization":[96],"arithmetic":[98],"with":[100],"probability":[101],"estimated":[102],"belief":[104],"propagation":[105],"lossless":[107],"The":[109],"proposed":[110],"lossy":[113],"asymptotically.":[120],"Furthermore,":[121],"practically":[124],"considerably":[128],"better":[129],"than":[130],"so-called":[132],"time":[133],"sharing":[134],"bound":[135],"of":[136],"function.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}