{"id":"https://openalex.org/W2563170243","doi":"https://doi.org/10.1109/isit.2004.1365274","title":"Explicit construction of families of LDPC codes with no 4-cycles","display_name":"Explicit construction of families of LDPC codes with no 4-cycles","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2563170243","doi":"https://doi.org/10.1109/isit.2004.1365274","mag":"2563170243"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5030848630","display_name":"Jon-Lark Kim","orcid":"https://orcid.org/0000-0002-0517-9359"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jon-Lark Kim","raw_affiliation_strings":["Dept. of Mathematics and Statistics, University of Nebraska, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Statistics, University of Nebraska, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082014574","display_name":"Uri N. Peled","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"U.N. Peled","raw_affiliation_strings":["Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041956026","display_name":"I.G. Perepelitsa","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Perepelitsa","raw_affiliation_strings":["Dept. of Mathematics and Statistics, University of Nebraska, Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Statistics, University of Nebraska, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052458305","display_name":"Vera Pless","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. Pless","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002855648","display_name":"Shmuel Friedland","orcid":"https://orcid.org/0000-0002-0423-5005"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Friedland","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5030848630"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.2493,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.6969697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9990000128746033,"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":0.9990000128746033,"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/combinatorics","display_name":"Combinatorics","score":0.7764182090759277},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.7048258185386658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6872279644012451},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6461403965950012},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.6214715838432312},{"id":"https://openalex.org/keywords/prime-power","display_name":"Prime power","score":0.6092231273651123},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5700543522834778},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5187094807624817},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.508330762386322},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5006856918334961},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.493701308965683},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.4139016270637512},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41314855217933655},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3723032772541046},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.31455105543136597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2735990285873413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1414453089237213}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7764182090759277},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.7048258185386658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6872279644012451},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6461403965950012},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6214715838432312},{"id":"https://openalex.org/C174072685","wikidata":"https://www.wikidata.org/wiki/Q1667469","display_name":"Prime power","level":3,"score":0.6092231273651123},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5700543522834778},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5187094807624817},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.508330762386322},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5006856918334961},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.493701308965683},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.4139016270637512},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41314855217933655},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3723032772541046},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.31455105543136597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2735990285873413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1414453089237213}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.59.6622","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.6622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cri.haifa.ac.il/technical/all_pless.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2012280556","https://openalex.org/W2019885050","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2156938362","https://openalex.org/W4246611826","https://openalex.org/W4256648168"],"related_works":["https://openalex.org/W2150639697","https://openalex.org/W3212819824","https://openalex.org/W3167562836","https://openalex.org/W4297803167","https://openalex.org/W4287029234","https://openalex.org/W2141572292","https://openalex.org/W2886682361","https://openalex.org/W2532924704","https://openalex.org/W2119604283","https://openalex.org/W2602611185"],"abstract_inverted_index":{"LDPC":[0,176],"codes":[1,7,26,71,177],"are":[2,159,165],"serious":[3],"contenders":[4],"to":[5,19],"turbo":[6],"in":[8],"terms":[9],"of":[10,14,24,69,81,88,152,157],"decoding":[11],"performance.":[12],"One":[13],"the":[15,76,86,146,150,153],"main":[16],"problems":[17],"is":[18,93,133],"give":[20],"an":[21,128],"explicit":[22],"construction":[23],"such":[25],"whose":[27],"Tanner":[28,67],"graphs":[29,65,68],"have":[30],"known":[31],"girth.":[32],"For":[33],"a":[34,45,134],"prime":[35,130],"power":[36],"q":[37,98,104],"and":[38,42,78,83,100,113,121,149,163],"m/spl":[39],"ges/2,":[40],"Lazebnik":[41],"Ustimenko":[43],"construct":[44],"q-regular":[46],"bipartite":[47],"graph":[48],"D(m,q)":[49],"on":[50],"2q/sup":[51],"m/":[52],"vertices,":[53],"which":[54],"has":[55,110,118],"girth":[56,111,119],"at":[57,94,160],"least":[58,95,161],"2/spl":[59],"lceil/m/2/spl":[60],"lfloor/+4.":[61],"We":[62,73,106,124,143,172],"regard":[63],"these":[64],"as":[66],"binary":[70],"LU(m,q).":[72],"can":[74],"determine":[75],"dimension":[77],"minimum":[79,90,147,154],"weight":[80,87,148,151],"LU(2,q),":[82],"show":[84,144],"that":[85,108,126,145],"its":[89],"stopping":[91,155],"set":[92,156],"q+2":[96,102],"for":[97,103,127,168],"odd":[99,129],"exactly":[101,166],"even.":[105],"know":[107],"D(2,q)":[109],"6":[112],"diameter":[114,122],"4,":[115],"whereas":[116],"D(3,q)":[117],"8":[120],"6.":[123],"prove":[125],"p,":[131],"LU(3,p)":[132],"[p/sup":[135],"3/,k]":[136],"code":[137],"with":[138],"k/spl":[139],"ges/(p/sup":[140],"3/-2p/sup":[141],"2/+3p-2)/2.":[142],"LU(3,q)":[158,170],"2q":[162,167],"they":[164],"many":[169],"codes.":[171],"find":[173],"some":[174],"interesting":[175],"by":[178],"our":[179],"partial":[180],"row":[181],"construction.":[182]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}