{"id":"https://openalex.org/W2366606682","doi":"https://doi.org/10.1109/isit.2016.7541755","title":"Distance verification for LDPC codes","display_name":"Distance verification for LDPC codes","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2366606682","doi":"https://doi.org/10.1109/isit.2016.7541755","mag":"2366606682"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1605.02410","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ilya Dumer","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Dumer","raw_affiliation_strings":["ECE Department, University of California at Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, University of California at Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Alexey A. Kovalev","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":"Alexey A. Kovalev","raw_affiliation_strings":["Department of Physics & Astronomy, University of Nebraska-Lincoln, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics & Astronomy, University of Nebraska-Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":null,"display_name":"Leonid P. Pryadko","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leonid P. Pryadko","raw_affiliation_strings":["Department of Physics & Astronomy, University of California at Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics & Astronomy, University of California at Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.03846838,"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":"2529","last_page":"2533"},"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.9995999932289124,"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/T11130","display_name":"Coding theory and cryptography","score":0.9988999962806702,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5615000128746033},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5598000288009644},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4553000032901764},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45080000162124634},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.44440001249313354},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39250001311302185},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.3603000044822693}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5615000128746033},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5598000288009644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5374000072479248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.534600019454956},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4553000032901764},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45080000162124634},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.44440001249313354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4388999938964844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43880000710487366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3837999999523163},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.32899999618530273},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2016.7541755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1605.02410","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.02410","pdf_url":"https://arxiv.org/pdf/1605.02410","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1605.02410","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.02410","pdf_url":"https://arxiv.org/pdf/1605.02410","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W72398006","https://openalex.org/W1536493828","https://openalex.org/W1565337244","https://openalex.org/W1897146492","https://openalex.org/W1997003296","https://openalex.org/W2093465763","https://openalex.org/W2103398070","https://openalex.org/W2104345270","https://openalex.org/W2108139581","https://openalex.org/W2108489927","https://openalex.org/W2111319461","https://openalex.org/W2115104320","https://openalex.org/W2126276563","https://openalex.org/W2127490352","https://openalex.org/W2130332106","https://openalex.org/W2169665116","https://openalex.org/W2169732368","https://openalex.org/W2963690510","https://openalex.org/W4300188436","https://openalex.org/W6607176436","https://openalex.org/W6630636337","https://openalex.org/W6678486045","https://openalex.org/W6770380337"],"related_works":[],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,14,27,43,55,76,80],"finding":[3],"code":[4],"distance":[5,38,56],"has":[6],"been":[7],"long":[8,81],"studied":[9],"for":[10,37,62,91],"the":[11,51,77],"generic":[12,53],"ensembles":[13,42],"linear":[15,44,92],"codes":[16],"and":[17,58],"led":[18],"to":[19,49],"several":[20],"algorithms":[21,54],"that":[22],"substantially":[23],"reduce":[24,87],"exponential":[25],"complexity":[26,33,61,68,88],"this":[28],"task.":[29],"However,":[30],"no":[31],"asymptotic":[32],"bounds":[34,69,85],"are":[35],"known":[36,90],"verification":[39,57],"in":[40,74],"other":[41],"codes.":[45,64,83,93],"Our":[46],"goal":[47],"is":[48],"re-design":[50],"existing":[52],"derive":[59],"their":[60],"LDPC":[63,82],"We":[65],"obtain":[66],"new":[67],"with":[70],"provable":[71],"performance":[72],"expressed":[73],"terms":[75],"erasure-correcting":[78],"thresholds":[79],"These":[84],"exponentially":[86],"estimates":[89]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}