{"id":"https://openalex.org/W2139746419","doi":"https://doi.org/10.1109/isit.2007.4557371","title":"Construction of a Lossy Source Code Using LDPC Matrices","display_name":"Construction of a Lossy Source Code Using LDPC Matrices","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2139746419","doi":"https://doi.org/10.1109/isit.2007.4557371","mag":"2139746419"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557371","doi":"https://doi.org/10.1109/isit.2007.4557371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557371","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5111947560","display_name":"Shigeki Miyake","orcid":null,"observed_orcids":[]},"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":"Shigeki Miyake","raw_affiliation_strings":["NTT, Network Innovation Laboratories, Yokosuka, Kanagawa, Japan","NTT, Yokosuka"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT, Network Innovation Laboratories, Yokosuka, Kanagawa, Japan","institution_ids":["https://openalex.org/I2251713219"]},{"raw_affiliation_string":"NTT, Yokosuka","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007060371","display_name":"Jun Muramatsu","orcid":"https://orcid.org/0000-0001-5016-5717","observed_orcids":["https://orcid.org/0000-0001-5016-5717"]},"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":"Jun Muramatsu","raw_affiliation_strings":["NTT, Communication Science Laboratories, Kyoto, Japan","Communication Science Laboratories, NTT, 2-4 Hikaridai Seika-cho Soraku-gun Kyoto 619-0237, Japan. Email: pure@cslab.kecl.ntt.co.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT, Communication Science Laboratories, Kyoto, Japan","institution_ids":["https://openalex.org/I2251713219"]},{"raw_affiliation_string":"Communication Science Laboratories, NTT, 2-4 Hikaridai Seika-cho Soraku-gun Kyoto 619-0237, Japan. Email: pure@cslab.kecl.ntt.co.jp","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":0.8127,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.67879345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1106","last_page":"1110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.4749000072479248,"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":0.4749000072479248,"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.33149999380111694,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.0843999981880188,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-source-coding","display_name":"lossy source coding","score":0.9700000286102295},{"id":"https://openalex.org/keywords/low-density-parity-check-codes","display_name":"LDPC codes","score":0.8939999938011169},{"id":"https://openalex.org/keywords/rate-distortion-function","display_name":"rate-distortion function","score":0.9120000004768372},{"id":"https://openalex.org/keywords/fidelity-criterion","display_name":"fidelity criterion","score":0.6909999847412109},{"id":"https://openalex.org/keywords/binary-alphabet","display_name":"binary alphabet","score":0.6359999775886536},{"id":"https://openalex.org/keywords/non-uniform-distribution","display_name":"non-uniform distribution","score":0.9010000228881836},{"id":"https://openalex.org/keywords/optimal-rates","display_name":"optimal rates","score":0.5180000066757202},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"distributed source coding","score":0.7039999961853027}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7737342119216919},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.693825364112854},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.6906704902648926},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6621027588844299},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.6520218253135681},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.6491410732269287},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.6189975142478943},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5981737375259399},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.5638212561607361},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.5585214495658875},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.527365505695343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5250770449638367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5163189768791199},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4964326024055481},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.46585187315940857},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.452449232339859},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.44766002893447876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44535452127456665},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.43457987904548645},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4197840690612793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3789657652378082},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3011600971221924},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11709803342819214},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09529370069503784},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07080078125},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557371","doi":"https://doi.org/10.1109/isit.2007.4557371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557371","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1549664537","https://openalex.org/W2035894387","https://openalex.org/W2099111195","https://openalex.org/W2108226783","https://openalex.org/W2114449874","https://openalex.org/W2119110145","https://openalex.org/W2160567110","https://openalex.org/W2162404506","https://openalex.org/W2164557001","https://openalex.org/W2478708596","https://openalex.org/W6674851815"],"related_works":["https://openalex.org/W1965894736","https://openalex.org/W2160567110","https://openalex.org/W2101698070","https://openalex.org/W4285502937","https://openalex.org/W2119110145","https://openalex.org/W633976793","https://openalex.org/W1609275552","https://openalex.org/W1991926347","https://openalex.org/W2067040182","https://openalex.org/W3119836289"],"abstract_inverted_index":{"Research":[0],"into":[1],"applying":[2],"LDPC":[3],"code":[4,50,76,105],"theory,":[5],"which":[6],"is":[7,41,88,97],"used":[8],"for":[9],"channel":[10],"coding,":[11],"to":[12],"source":[13,34],"coding":[14,35],"has":[15],"received":[16],"a":[17,33,38,48,55,58,62,74,82,85,93],"lot":[18],"of":[19,54,65,81],"attention":[20],"in":[21],"several":[22],"research":[23],"fields":[24],"such":[25],"as":[26],"Distributed":[27],"Source":[28],"Coding.":[29],"In":[30],"this":[31],"paper":[32],"problem":[36],"with":[37],"fidelity":[39,66,94],"criterion":[40],"considered.":[42],"Matsunaga":[43],"et":[44],"al.":[45],"[6]":[46],"constructed":[47],"lossy":[49,75],"under":[51,77],"the":[52,78,104,108],"conditions":[53,80],"binary":[56,83],"alphabet,":[57,84],"uniform":[59],"distribution,":[60],"and":[61,72,92,99,101],"Hamming":[63],"measure":[64,95],"criterion.":[67],"We":[68],"extend":[69],"their":[70],"results":[71],"construct":[73],"extended":[79],"distribution":[86],"that":[87,96,103],"not":[89],"necessarily":[90],"uniform,":[91],"bounded":[98],"additive":[100],"show":[102],"can":[106],"achieve":[107],"optimal":[109],"rate,":[110],"rate-distortion":[111],"function.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2016-06-24T00:00:00"}