{"id":"https://openalex.org/W2166520865","doi":"https://doi.org/10.1109/isit.2004.1365272","title":"Construction of good LDPC codes using dilation matrices","display_name":"Construction of good LDPC codes using dilation matrices","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2166520865","doi":"https://doi.org/10.1109/isit.2004.1365272","mag":"2166520865"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365272","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/A5056687416","display_name":"Marcus Greferath","orcid":"https://orcid.org/0000-0002-3102-4350"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Greferath","raw_affiliation_strings":["Department of Mathematics, San Diego State University, San Diego, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017124468","display_name":"Michael E. O\u2019Sullivan","orcid":"https://orcid.org/0000-0002-2735-2407"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. O'Sullivan","raw_affiliation_strings":["Department of Mathematics, San Diego State University, San Diego, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098418811","display_name":"A. Smarandache","orcid":null},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Smarandache","raw_affiliation_strings":["Department of Mathematics, San Diego State University, San Diego, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056687416"],"corresponding_institution_ids":["https://openalex.org/I26538001"],"apc_list":null,"apc_paid":null,"fwci":0.9963,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82620407,"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":"235","last_page":"235"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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.9941999912261963,"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.8444011211395264},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5826436281204224},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5519834160804749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5414834022521973},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5396866798400879},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.534980297088623},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.4948522448539734},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.4798290729522705},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.45309334993362427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41957131028175354},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41605526208877563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3721047043800354},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35268521308898926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35064828395843506}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8444011211395264},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5826436281204224},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5519834160804749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5414834022521973},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5396866798400879},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.534980297088623},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.4948522448539734},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.4798290729522705},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.45309334993362427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41957131028175354},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41605526208877563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3721047043800354},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35268521308898926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35064828395843506},{"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/isit.2004.1365272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365272","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.85.2982","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-rohan.sdsu.edu/~rsmarand/html/ISIT-2004-long-MikMarcRox.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1973712217","https://openalex.org/W2054649237","https://openalex.org/W2102718558","https://openalex.org/W4285719527"],"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/W2082228868","https://openalex.org/W2566148463","https://openalex.org/W4387300303"],"abstract_inverted_index":{"A":[0],"new":[1,25],"method":[2],"is":[3],"given":[4],"to":[5,22,48],"construct":[6],"low-density":[7],"parity":[8],"check":[9],"codes":[10,36,42,50],"the":[11,24],"graphs":[12],"of":[13,16],"which":[14],"are":[15,37],"designed":[17],"girth.":[18],"We":[19],"give":[20],"examples":[21],"illustrate":[23],"method,":[26],"and":[27,46],"also":[28],"present":[29],"performance":[30],"diagrams":[31],"that":[32,34],"suggest":[33],"these":[35],"as":[38,40],"good":[39],"random":[41,49],"in":[43],"low":[44],"SNR,":[45],"preferable":[47],"at":[51],"higher":[52],"SNR.":[53]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}