{"id":"https://openalex.org/W2109836018","doi":"https://doi.org/10.1109/isit.2009.5205707","title":"Efficient LDPC codes over GF(q) for lossy data compression","display_name":"Efficient LDPC codes over GF(q) for lossy data compression","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2109836018","doi":"https://doi.org/10.1109/isit.2009.5205707","mag":"2109836018"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205707","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0901.4467","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alfredo Braunstein","orcid":null},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alfredo Braunstein","raw_affiliation_strings":["Dipartimento di Fisica, Politecnico di Turino, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Fisica, Politecnico di Turino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Farbod Kayhan","orcid":null},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Farbod Kayhan","raw_affiliation_strings":["Dipartimento di Fisica, Politecnico di Turino, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Fisica, Politecnico di Turino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":null,"display_name":"Riccardo Zecchina","orcid":null},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Riccardo Zecchina","raw_affiliation_strings":["Dipartimento di Fisica, Politecnico di Turino, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Fisica, Politecnico di Turino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":null,"apc_paid":null,"fwci":0.728,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.74380369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1978","last_page":"1982"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9988999962806702,"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.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.8337000012397766},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.65420001745224},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.6021999716758728},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5785999894142151},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.557200014591217},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4878999888896942},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47040000557899475},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4487000107765198}],"concepts":[{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.8337000012397766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.683899998664856},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.65420001745224},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.6021999716758728},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5785999894142151},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.557200014591217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5117999911308289},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4878999888896942},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47040000557899475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4374000132083893},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3991999924182892},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.3010999858379364},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.296999990940094},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29030001163482666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28279998898506165},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.25540000200271606},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205707","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"},{"id":"pmh:oai:arXiv.org:0901.4467","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0901.4467","pdf_url":"https://arxiv.org/pdf/0901.4467","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0901.4467","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0901.4467","pdf_url":"https://arxiv.org/pdf/0901.4467","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1533562602","https://openalex.org/W1534663296","https://openalex.org/W2011442073","https://openalex.org/W2027455694","https://openalex.org/W2028644481","https://openalex.org/W2061302090","https://openalex.org/W2071254403","https://openalex.org/W2109866575","https://openalex.org/W2114337345","https://openalex.org/W2115649908","https://openalex.org/W2117473974","https://openalex.org/W2118926208","https://openalex.org/W2119110145","https://openalex.org/W2125566184","https://openalex.org/W2128986049","https://openalex.org/W2135764410","https://openalex.org/W2137049264","https://openalex.org/W2137699000","https://openalex.org/W2160567110","https://openalex.org/W2163118554","https://openalex.org/W2164557001","https://openalex.org/W2169415915","https://openalex.org/W2169732368","https://openalex.org/W2173776306","https://openalex.org/W6637562678"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"the":[5,45,59,76,80,93,97,106],"lossy":[6,22],"compression":[7],"of":[8,52,79,96,108],"a":[9,15,19,50,102],"binary":[10],"symmetric":[11],"source.":[12],"We":[13],"present":[14],"scheme":[16,31],"that":[17],"provides":[18],"low":[20],"complexity":[21,57],"compressor":[23],"with":[24],"near":[25],"optimal":[26],"empirical":[27],"performance.":[28],"The":[29,55],"proposed":[30],"is":[32,42,61,75,111],"based":[33],"on":[34],"b-reduced":[35],"ultra-sparse":[36],"LDPC":[37],"codes":[38],"over":[39],"GF(q).":[40],"Encoding":[41],"performed":[43,90],"by":[44],"Reinforced":[46],"Belief":[47,53],"Propagation":[48],"algorithm,":[49],"variant":[51],"Propagation.":[54],"computational":[56],"at":[58],"encoder":[60],"O(<":[62],"d":[63,73],">":[64,74],".n.q.":[65],"log":[66],"<sub":[67],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[68],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[69],"q),":[70],"where":[71],"<":[72],"average":[77],"degree":[78],"check":[81],"nodes.":[82],"For":[83,101],"our":[84],"code":[85],"ensemble,":[86],"decoding":[87],"can":[88],"be":[89],"iteratively":[91],"following":[92],"inverse":[94],"steps":[95],"leaf":[98],"removal":[99],"algorithm.":[100],"sparse":[103],"parity-check":[104],"matrix":[105],"number":[107],"needed":[109],"operations":[110],"O(n).":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}