{"id":"https://openalex.org/W2151660719","doi":"https://doi.org/10.1109/wcnc.2005.1424653","title":"An algorithm for the estimation of the minimum distance of LDPC codes","display_name":"An algorithm for the estimation of the minimum distance of LDPC codes","publication_year":2005,"publication_date":"2005-04-25","ids":{"openalex":"https://openalex.org/W2151660719","doi":"https://doi.org/10.1109/wcnc.2005.1424653","mag":"2151660719"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2005.1424653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2005.1424653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2005","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/A5040208578","display_name":"F. Daneshgaran","orcid":null},"institutions":[{"id":"https://openalex.org/I27825529","display_name":"California State University Los Angeles","ror":"https://ror.org/0294hxs80","country_code":"US","type":"education","lineage":["https://openalex.org/I27825529"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. Daneshgaran","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA","institution_ids":["https://openalex.org/I27825529"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074808284","display_name":"Massimiliano Laddomada","orcid":"https://orcid.org/0000-0003-3562-6161"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Laddomada","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046051225","display_name":"M. Mondin","orcid":"https://orcid.org/0000-0003-3105-3802"},"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":"M. Mondin","raw_affiliation_strings":["DELEN, Politecnico di Torino, Turin, ITALY"],"affiliations":[{"raw_affiliation_string":"DELEN, Politecnico di Torino, Turin, ITALY","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040208578"],"corresponding_institution_ids":["https://openalex.org/I27825529"],"apc_list":null,"apc_paid":null,"fwci":1.3679,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85316671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1046","last_page":"1049"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9866999983787537,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9381702542304993},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7535890340805054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6809070110321045},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.639267086982727},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6010871529579163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5829135179519653},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5523621439933777},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.49935460090637207},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.48881956934928894},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4870898723602295},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4743955135345459},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.4461572468280792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3043596148490906},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2646041810512543},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20736607909202576},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07113054394721985}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9381702542304993},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7535890340805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6809070110321045},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.639267086982727},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6010871529579163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5829135179519653},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5523621439933777},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.49935460090637207},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.48881956934928894},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4870898723602295},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4743955135345459},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.4461572468280792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3043596148490906},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2646041810512543},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20736607909202576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07113054394721985},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wcnc.2005.1424653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2005.1424653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2005","raw_type":"proceedings-article"},{"id":"pmh:oai:porto.polito.it:1662951","is_oa":false,"landing_page_url":"http://porto.polito.it/1662951/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1930522892","https://openalex.org/W2103353540","https://openalex.org/W2110505801","https://openalex.org/W2111319461","https://openalex.org/W2144984115","https://openalex.org/W2481373004"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2485298482","https://openalex.org/W1999504355","https://openalex.org/W97175492","https://openalex.org/W1541978849","https://openalex.org/W2116328306","https://openalex.org/W2164812798","https://openalex.org/W2534678992","https://openalex.org/W2348104539","https://openalex.org/W2147792954"],"abstract_inverted_index":{"The":[0,55],"evaluation":[1],"of":[2,6,21,40,48,52,81,97,107],"the":[3,17,22,41,49,53,67,85,95,98],"minimum":[4,50],"distance":[5,51],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10],"remains":[11],"an":[12,37],"open":[13],"problem":[14],"due":[15],"to":[16,61,84,117],"rather":[18],"large":[19],"dimension":[20],"parity":[23],"check":[24],"matrix":[25],"H":[26],"associated":[27],"with":[28],"any":[29,118],"practical":[30],"code.":[31,120],"In":[32],"this":[33,82],"article,":[34],"we":[35],"propose":[36],"effective":[38],"modification":[39],"error":[42],"impulse":[43],"(EI)":[44],"technique":[45],"for":[46,72,90],"estimation":[47],"LDPCs.":[54,91],"EI":[56],"method":[57,83],"is":[58,113],"successfully":[59],"applied":[60],"suboptimum":[62,86],"decoding":[63,70],"algorithms":[64],"such":[65],"as":[66],"iterative":[68,87],"MAP":[69],"algorithm":[71,89],"turbo":[73],"codes.":[74],"We":[75],"present":[76],"novel":[77],"modifications":[78],"and":[79,115],"extensions":[80],"sum-product":[88],"Simulation":[92],"results":[93],"validate":[94],"functionality":[96],"proposed":[99],"technique.":[100],"Simulations":[101],"focus":[102],"on":[103],"a":[104],"particular":[105],"class":[106],"LDPC":[108,119],"codes,":[109],"but":[110],"our":[111],"approach":[112],"general":[114],"applies":[116]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}