{"id":"https://openalex.org/W1972606153","doi":"https://doi.org/10.1109/isit.2005.1523568","title":"Low-rate generalized low-density parity-check codes with hadamard constraints","display_name":"Low-rate generalized low-density parity-check codes with hadamard constraints","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1972606153","doi":"https://doi.org/10.1109/isit.2005.1523568","mag":"1972606153"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523568","doi":"https://doi.org/10.1109/isit.2005.1523568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523568","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":"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W1972606153"],"child_works_count":0,"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/A5113601291","display_name":"Guosen Yue","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guosen Yue","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100741314","display_name":"Li Ping","orcid":"https://orcid.org/0000-0002-4933-5093","observed_orcids":["https://orcid.org/0000-0002-4933-5093"]},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ping Li","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100382658","display_name":"Xiaodong Wang","orcid":"https://orcid.org/0000-0002-2945-9240","observed_orcids":["https://orcid.org/0000-0002-2945-9240"]},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaodong Wang","raw_affiliation_strings":["Department of Electrical Engineering, Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.509,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.90800299,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1377","last_page":"1381"},"is_retracted":false,"is_pulled":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/T11130","display_name":"Coding theory and cryptography","score":9.999999747378752e-05,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-rate-codes","display_name":"low-rate codes","score":0.7049999833106995},{"id":"https://openalex.org/keywords/achievable-capacity","display_name":"achievable capacity","score":0.7110000252723694},{"id":"https://openalex.org/keywords/density-evolution","display_name":"density evolution","score":0.5910000205039978},{"id":"https://openalex.org/keywords/exit-charts","display_name":"EXIT charts","score":0.8230000138282776},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"bit error rate","score":0.7770000100135803},{"id":"https://openalex.org/keywords/shannon-limit","display_name":"Shannon limit","score":0.9750000238418579}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9061378836631775},{"id":"https://openalex.org/C60292330","wikidata":"https://www.wikidata.org/wiki/Q1014065","display_name":"Hadamard transform","level":2,"score":0.7810221910476685},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7330843210220337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4861614406108856},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.4801761209964752},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4753453731536865},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.47408759593963623},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.45513853430747986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4512809216976166},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4312419295310974},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4155963361263275},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4120347201824188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3913861811161041},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3787911832332611},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33567893505096436},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2633301317691803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25314778089523315},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.12400013208389282},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523568","doi":"https://doi.org/10.1109/isit.2005.1523568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523568","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":"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.8163","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.8163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.cityu.edu.hk/%7Eliping/Research/Conference/LDPCH.pdf","raw_type":"text"}],"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/W2087040279","https://openalex.org/W2092124262","https://openalex.org/W2101394529","https://openalex.org/W2114468914","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2130034326","https://openalex.org/W2130458083","https://openalex.org/W2131705283","https://openalex.org/W2160390925","https://openalex.org/W2170758137"],"related_works":["https://openalex.org/W2105006836","https://openalex.org/W3157084865","https://openalex.org/W4416152717","https://openalex.org/W2787280211","https://openalex.org/W2494020588","https://openalex.org/W7204607455","https://openalex.org/W2018112271","https://openalex.org/W2093621217","https://openalex.org/W2126324363"],"abstract_inverted_index":{"We":[0,71],"consider":[1,37],"the":[2,25,43,57,74,86,130],"design":[3],"and":[4],"analysis":[5],"of":[6,121],"generalized":[7],"low-density":[8],"parity-check":[9,27],"(GLDPC)":[10],"codes":[11,59],"specified":[12],"by":[13,30,89,95],"a":[14,47,79,90,107,117],"bipartite":[15],"Tanner":[16],"graph,":[17],"as":[18],"with":[19,24,56,111],"standard":[20],"LDPC":[21],"codes,":[22],"but":[23],"single":[26],"constraints":[28,41],"replaced":[29],"general":[31],"coding":[32],"constraints.":[33],"In":[34],"particular,":[35],"we":[36],"imposing":[38],"Hadamard":[39],"code":[40,66,76,110],"at":[42],"check":[44],"nodes":[45],"for":[46],"low-rate":[48],"approach,":[49],"termed":[50],"LDPC-Hadamard":[51,65,75,109],"codes.":[52],"The":[53],"achievable":[54],"capacity":[55],"GLDPC":[58],"is":[60,68],"then":[61,72],"discussed.":[62],"A":[63],"modified":[64],"graph":[67],"also":[69],"proposed.":[70],"optimize":[73],"ensemble":[77],"using":[78],"low-complexity":[80],"optimization":[81],"method":[82],"based":[83],"on":[84],"approximating":[85],"density":[87],"evolution":[88],"one-dimensional":[91],"dynamic":[92],"system":[93],"represented":[94],"an":[96],"extrinsic":[97],"mutual":[98],"information":[99],"transfer":[100],"(EXIT)":[101],"chart.":[102],"Simulation":[103],"results":[104],"show":[105],"that":[106],"rate-0.003":[108],"large":[112],"block":[113],"length":[114],"can":[115],"achieve":[116],"bit-error-rate":[118],"(BER)":[119],"performance":[120],"10-5at":[122],"-1.44":[123],"dB,":[124],"only":[125],"0.15":[126],"dB":[127],"away":[128],"from":[129],"ultimate":[131],"Shannon":[132],"limit":[133],"(-1.592":[134],"dB)":[135]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1972606153","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
