{"id":"https://openalex.org/W2106891068","doi":"https://doi.org/10.1109/isit.2010.5513600","title":"On the typical minimum distance of protograph-based generalized LDPC codes","display_name":"On the typical minimum distance of protograph-based generalized LDPC codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2106891068","doi":"https://doi.org/10.1109/isit.2010.5513600","mag":"2106891068"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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/A5066576905","display_name":"Shadi Abu\u2010Surra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101778","display_name":"Samsung (United States)","ror":"https://ror.org/01bfbvm65","country_code":"US","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210101778"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shadi Abu-Surra","raw_affiliation_strings":["Samsung Telecommunications of America, Richardson, TX, USA","Samsung Telecommunications America, Richardson, TX 75082, USA"],"affiliations":[{"raw_affiliation_string":"Samsung Telecommunications of America, Richardson, TX, USA","institution_ids":["https://openalex.org/I4210101778"]},{"raw_affiliation_string":"Samsung Telecommunications America, Richardson, TX 75082, USA","institution_ids":["https://openalex.org/I4210101778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033923371","display_name":"D. Divsalar","orcid":"https://orcid.org/0000-0001-9176-3078"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]},{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dariush Divsalar","raw_affiliation_strings":["Jet Propulsion Laboratory, California Institute of Technology, USA","Jet propulsion laboratory, California institute of technology, USA"],"affiliations":[{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet propulsion laboratory, California institute of technology, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033032709","display_name":"W.E. Ryan","orcid":"https://orcid.org/0000-0002-6379-2186"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William E. Ryan","raw_affiliation_strings":["University of Arizona Tucson, Tucson, AZ, USA","University of Arizona, Tucson 85721 USA"],"affiliations":[{"raw_affiliation_string":"University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"University of Arizona, Tucson 85721 USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066576905"],"corresponding_institution_ids":["https://openalex.org/I4210101778"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.19162783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"719","last_page":"723"},"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.9991999864578247,"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.9959999918937683,"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/code-word","display_name":"Code word","score":0.6850192546844482},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6265259385108948},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5948424935340881},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5914465188980103},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5484058856964111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.54411780834198},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4848240613937378},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48133572936058044},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.45067787170410156},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4482477307319641},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42878878116607666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3845033347606659},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.38416507840156555},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36153799295425415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35314929485321045},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06362706422805786}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6850192546844482},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6265259385108948},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5948424935340881},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5914465188980103},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5484058856964111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.54411780834198},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4848240613937378},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48133572936058044},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.45067787170410156},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4482477307319641},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42878878116607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3845033347606659},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.38416507840156555},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36153799295425415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35314929485321045},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06362706422805786},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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":23,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W2035151585","https://openalex.org/W2076991056","https://openalex.org/W2097900809","https://openalex.org/W2102180339","https://openalex.org/W2102541782","https://openalex.org/W2108489927","https://openalex.org/W2119218121","https://openalex.org/W2121899554","https://openalex.org/W2126276563","https://openalex.org/W2128552304","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2145714519","https://openalex.org/W2163496715","https://openalex.org/W2168300614","https://openalex.org/W2168381131","https://openalex.org/W3105490918","https://openalex.org/W3125301056","https://openalex.org/W4300188436","https://openalex.org/W6603727012","https://openalex.org/W6684866254","https://openalex.org/W6790120772"],"related_works":["https://openalex.org/W2479327835","https://openalex.org/W2110972223","https://openalex.org/W2163036861","https://openalex.org/W2540115800","https://openalex.org/W2167713507","https://openalex.org/W2034110706","https://openalex.org/W1584569498","https://openalex.org/W73995444","https://openalex.org/W2000151856","https://openalex.org/W2132973822"],"abstract_inverted_index":{"Protograph-based":[0],"generalized":[1],"LDPC":[2],"(GLDPC)":[3],"codes":[4,29,62],"have":[5,113],"the":[6,34,39,55,70,84,89,100,122,126],"advantages":[7],"of":[8,41,72,102,125],"a":[9,20],"simple":[10],"design":[11],"procedure":[12],"and":[13,17,66],"highly":[14],"structured":[15],"encoders":[16],"decoders.":[18],"Recently,":[19],"technique":[21],"for":[22,27,45,59],"computing":[23],"ensemble":[24,56,90],"weight":[25,57,73],"enumerators":[26,58],"GLDPC":[28,47,61],"has":[30],"been":[31],"published.":[32],"In":[33],"current":[35],"paper,":[36],"we":[37,51,68],"investigate":[38],"existence":[40],"typical":[42,85,114],"minimum":[43,86,115,123],"distance":[44,87],"protograph-based":[46],"codes.":[48],"That":[49],"is,":[50],"first":[52],"upper":[53],"bound":[54],"finite-length":[60],"based":[63],"on":[64,99],"protographs,":[65],"then":[67],"consider":[69],"sum":[71],"enumerators.":[74],"The":[75],"results":[76],"allow":[77],"us":[78],"to":[79,106,112,121],"determine":[80],"whether":[81],"or":[82],"not":[83],"in":[88],"grows":[91],"linearly":[92],"with":[93],"codeword":[94],"length.":[95],"We":[96],"provide":[97],"conditions":[98,118],"connections":[101],"degree-2":[103],"variable":[104],"nodes":[105,108],"constraint":[107,127],"(short":[109],"block":[110],"codes)":[111],"distance.":[116],"These":[117],"are":[119],"related":[120],"distances":[124],"nodes.":[128]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}