{"id":"https://openalex.org/W2075937707","doi":"https://doi.org/10.1109/isit.2005.1523458","title":"An algebraic method for constructing efficiently encodable irregular LDPC codes","display_name":"An algebraic method for constructing efficiently encodable irregular LDPC codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2075937707","doi":"https://doi.org/10.1109/isit.2005.1523458","mag":"2075937707"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5062365752","display_name":"Hachiro Fujita","orcid":"https://orcid.org/0000-0002-1134-9203"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Fujita","raw_affiliation_strings":["Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005522593","display_name":"Maki Ohata","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"M. Ohata","raw_affiliation_strings":["Department of Information and Communication Engineering, University of Tokyo, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, University of Tokyo, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110189199","display_name":"K. Sakaniwa","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Sakaniwa","raw_affiliation_strings":["Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5886,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66744084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"104","issue":"729","first_page":"855","last_page":"859"},"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.9983999729156494,"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.9955000281333923,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8894252777099609},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.7361987829208374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5240438580513},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5082015991210938},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.5080084800720215},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.49796581268310547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46740084886550903},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3943285048007965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3639894723892212},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.30918604135513306},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06260618567466736}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8894252777099609},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7361987829208374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5240438580513},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5082015991210938},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.5080084800720215},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.49796581268310547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46740084886550903},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3943285048007965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3639894723892212},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.30918604135513306},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06260618567466736},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2005.1523458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:t2r2.star.titech.ac.jp:00207551","is_oa":false,"landing_page_url":"http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100397277","pdf_url":null,"source":{"id":"https://openalex.org/S4377196385","display_name":"Tokyo Tech Research Repository (Tokyo Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114531698","host_organization_name":"Tokyo Institute of Technology","host_organization_lineage":["https://openalex.org/I114531698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"mag:2905582423","is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/20050317qAdv/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W1493541001","https://openalex.org/W1533115413","https://openalex.org/W1973712217","https://openalex.org/W2071304218","https://openalex.org/W2122703296","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2133441360","https://openalex.org/W2162426529","https://openalex.org/W2562965985","https://openalex.org/W4300188436","https://openalex.org/W6629343882","https://openalex.org/W6683774106"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2368824897","https://openalex.org/W2126543779","https://openalex.org/W2147429396","https://openalex.org/W2391555801","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2532556608","https://openalex.org/W2379365082","https://openalex.org/W2388289192"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"an":[5,22],"algebraic":[6],"construction":[7],"of":[8],"efficiently":[9],"encodable":[10],"irregular":[11,16,44],"LDPC":[12,17,45],"codes.":[13],"The":[14],"proposed":[15,36],"codes":[18,37,46],"have":[19],"not":[20],"only":[21],"efficient":[23],"encoding":[24],"algorithm":[25],"but":[26],"also":[27],"guaranteed":[28],"minimum":[29],"distances.":[30],"Simulation":[31],"results":[32],"show":[33],"that":[34],"the":[35],"perform":[38],"well":[39],"compared":[40],"to":[41],"randomly":[42],"constructed":[43]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}