{"id":"https://openalex.org/W1511026007","doi":"https://doi.org/10.1109/pimrc.2004.1368788","title":"Expurgated sphere bound for LDPC","display_name":"Expurgated sphere bound for LDPC","publication_year":2005,"publication_date":"2005-01-17","ids":{"openalex":"https://openalex.org/W1511026007","doi":"https://doi.org/10.1109/pimrc.2004.1368788","mag":"1511026007"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2004.1368788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2004.1368788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","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/A5011563329","display_name":"Vu-Duc Ngo","orcid":"https://orcid.org/0000-0002-5214-2620"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vu-Duc Ngo","raw_affiliation_strings":["Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","institution_ids":[]},{"raw_affiliation_string":"Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100916585","display_name":"Hae-Wook Choi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hae-Wook Choi","raw_affiliation_strings":["Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","institution_ids":[]},{"raw_affiliation_string":"Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109165470","display_name":"Sin\u2010Chong Park","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sin-Chong Park","raw_affiliation_strings":["Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Systems VLSI Lab, SIT1 Research Center, Information and Communications University, Taejon, South Korea","institution_ids":[]},{"raw_affiliation_string":"Center of SITI Res., Inf. & Commun. Univ., Taejeon, South Korea","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011563329"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0782882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"e84","issue":null,"first_page":"2591","last_page":"2595"},"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.9995999932289124,"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.9972000122070312,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7024635076522827},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6267327666282654},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5593683123588562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5527059435844421},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5218468904495239},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5183168649673462},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5094495415687561},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4954725503921509},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49262624979019165},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4699818193912506},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.45137089490890503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4423922896385193},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.38089364767074585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3159865736961365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2995185852050781}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7024635076522827},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6267327666282654},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5593683123588562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5527059435844421},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5218468904495239},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5183168649673462},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5094495415687561},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4954725503921509},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49262624979019165},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4699818193912506},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.45137089490890503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4423922896385193},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.38089364767074585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3159865736961365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2995185852050781},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc.2004.1368788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2004.1368788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W182162396","https://openalex.org/W1971461403","https://openalex.org/W1974858474","https://openalex.org/W2017710944","https://openalex.org/W2083233139","https://openalex.org/W2124977744","https://openalex.org/W2125007832","https://openalex.org/W2128765501","https://openalex.org/W2156938362","https://openalex.org/W2170691229","https://openalex.org/W4256648168","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W2740543340","https://openalex.org/W2119135810","https://openalex.org/W2951416090","https://openalex.org/W2105471374","https://openalex.org/W4302771537","https://openalex.org/W2008960744","https://openalex.org/W2014631828","https://openalex.org/W2142293082"],"abstract_inverted_index":{"The":[0,27],"tightened":[1,66],"union":[2,25],"bound":[3,78],"on":[4],"the":[5,19,24,40,44,49,54,58,76,81,90,99],"block":[6],"error":[7],"probability":[8],"for":[9],"low":[10],"density":[11],"parity":[12],"check":[13],"codes":[14],"is":[15,32,71],"derived":[16],"by":[17,34],"eliminating":[18],"useless":[20],"codewords":[21,31,45],"out":[22],"of":[23,29,43,83,93],"bound.":[26,68],"elimination":[28],"these":[30],"done":[33],"applying":[35],"Verdu's":[36],"theorem":[37],"and":[38],"calculating":[39],"Hamming":[41],"weight":[42],"that":[46],"belong":[47],"to":[48,57],"irreducible":[50],"set.":[51],"By":[52],"utilizing":[53],"similar":[55],"technique":[56],"conventional":[59,77],"sphere":[60,67],"bound,":[61],"we":[62],"obtain":[63],"a":[64],"new":[65],"This":[69],"approach":[70],"not":[72],"only":[73],"simpler":[74],"than":[75],"techniques":[79],"in":[80,97],"sense":[82],"computation":[84],"complexity,":[85],"but":[86],"it":[87],"also":[88],"extends":[89],"reliable":[91],"region":[92],"E/sub":[94],"b//N/sub":[95],"0/":[96],"which":[98],"bounds":[100],"yields":[101],"meaningful":[102],"results.":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}