{"id":"https://openalex.org/W2148762366","doi":"https://doi.org/10.1109/icc.2006.254896","title":"The Minimal Product Parity Check Matrix and Its Application","display_name":"The Minimal Product Parity Check Matrix and Its Application","publication_year":2006,"publication_date":"2006-06-01","ids":{"openalex":"https://openalex.org/W2148762366","doi":"https://doi.org/10.1109/icc.2006.254896","mag":"2148762366"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2006.254896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2006.254896","pdf_url":null,"source":{"id":"https://openalex.org/S4363608495","display_name":"2006 IEEE International Conference on Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2006 IEEE International Conference on Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102939042","display_name":"Morteza Esmaeili","orcid":"https://orcid.org/0000-0002-8894-7017"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Morteza Esmaeili","raw_affiliation_strings":["Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102939042"],"corresponding_institution_ids":["https://openalex.org/I170013655"],"apc_list":null,"apc_paid":null,"fwci":0.235,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.4869259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"42","issue":null,"first_page":"1113","last_page":"1118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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.996999979019165,"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.9937999844551086,"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/tanner-graph","display_name":"Tanner graph","score":0.9309827089309692},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.786876916885376},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.720209538936615},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5986433625221252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.517857551574707},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5160967707633972},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5078282952308655},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.476815402507782},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.46026164293289185},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44493240118026733},{"id":"https://openalex.org/keywords/matrix-representation","display_name":"Matrix representation","score":0.4322260618209839},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42741119861602783},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.42720043659210205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41597649455070496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3980972170829773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3684998154640198},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07538172602653503}],"concepts":[{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.9309827089309692},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.786876916885376},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.720209538936615},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5986433625221252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.517857551574707},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5160967707633972},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5078282952308655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.476815402507782},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.46026164293289185},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44493240118026733},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.4322260618209839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42741119861602783},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.42720043659210205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41597649455070496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3980972170829773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3684998154640198},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07538172602653503},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2006.254896","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2006.254896","pdf_url":null,"source":{"id":"https://openalex.org/S4363608495","display_name":"2006 IEEE International Conference on Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2006 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1968525006","https://openalex.org/W2043309691","https://openalex.org/W2087040279","https://openalex.org/W2114869758","https://openalex.org/W2119990840","https://openalex.org/W2122227456","https://openalex.org/W2123796443","https://openalex.org/W2125926280","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2129031807","https://openalex.org/W2130255084","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2137813581","https://openalex.org/W2142927000","https://openalex.org/W2143781601","https://openalex.org/W2146694142","https://openalex.org/W2156938362","https://openalex.org/W2169732368","https://openalex.org/W2182112064","https://openalex.org/W2293231900","https://openalex.org/W2798588639","https://openalex.org/W3194602862","https://openalex.org/W4256648168","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2350442631","https://openalex.org/W3212819824","https://openalex.org/W3167562836","https://openalex.org/W4297803167","https://openalex.org/W2150639697","https://openalex.org/W2378907853","https://openalex.org/W4287029234","https://openalex.org/W2330319897","https://openalex.org/W3000741554","https://openalex.org/W2076495982"],"abstract_inverted_index":{"In":[0],"decoding":[1,9],"a":[2,17,80,98],"linear":[3],"block":[4],"code":[5,112],"C":[6,21],"by":[7],"iterative":[8],"algorithms,":[10],"these":[11,37],"algorithms":[12],"are":[13,120],"essentially":[14],"applied":[15],"on":[16,39],"graphical":[18],"representation":[19],"of":[20,33,36,42,53,56,123,138,141],"such":[22,62],"as":[23],"Tanner":[24,99,124],"graph":[25,100],"and":[26,92,118,128],"factor":[27],"graph.":[28],"Due":[29],"to":[30,83],"the":[31,34,40,71,94,110,121,134,139,142],"impact":[32,137],"structure":[35],"graphs":[38,125],"performance":[41],"code,":[43],"we":[44],"consider":[45],"minimal":[46],"parity":[47,143],"check":[48,144],"matrices(matrices":[49],"with":[50,101],"minimum":[51],"number":[52],"nonzero":[54],"entries)":[55],"product":[57,75,111],"codes.":[58,87],"An":[59],"algorithm":[60],"constructing":[61],"matrices":[63],"is":[64,78],"given.":[65],"It":[66],"turns":[67],"out":[68],"that":[69],"under":[70],"given":[72],"construction":[73,95],"method,":[74],"coding":[76],"technique":[77],"indeed":[79],"powerful":[81],"method":[82,96],"construct":[84],"irregular":[85],"LDPC":[86],"Given":[88],"two":[89],"codes":[90],"A":[91,113,127],"B,":[93,115,129],"produces":[97],"girth":[102,122],"g":[103],":=":[104],"min":[105],"{8,":[106],"ga,":[107],"gb}":[108],"for":[109],"\u2297":[114],"where":[116],"ga":[117],"gb":[119],"representing":[126],"respectively.":[130],"Simulation":[131],"results":[132],"confirm":[133],"positive":[135],"practical":[136],"minimality":[140],"matrices.":[145]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}