{"id":"https://openalex.org/W4289655136","doi":"https://doi.org/10.1109/isit50566.2022.9834770","title":"Minimum distance and other properties of quasi-dyadic parity check codes","display_name":"Minimum distance and other properties of quasi-dyadic parity check codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655136","doi":"https://doi.org/10.1109/isit50566.2022.9834770"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834770","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5040657380","display_name":"Meraiah Martinez","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":true,"raw_author_name":"Meraiah Martinez","raw_affiliation_strings":["University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"],"affiliations":[{"raw_affiliation_string":"University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072790914","display_name":"Christine A. Kelley","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":"Christine A. Kelley","raw_affiliation_strings":["University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"],"affiliations":[{"raw_affiliation_string":"University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040657380"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.432,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46273637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2118","last_page":"2123"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994000196456909,"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.8830424547195435},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6463501453399658},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6352288126945496},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5271146893501282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5116506218910217},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4903004467487335},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.48785853385925293},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.46063220500946045},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4578680992126465},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4395427107810974},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4277886152267456},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.413895845413208},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.4132731854915619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3912324011325836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34893280267715454},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3352864384651184},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2153306007385254},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11570996046066284}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8830424547195435},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6463501453399658},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6352288126945496},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5271146893501282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5116506218910217},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4903004467487335},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.48785853385925293},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.46063220500946045},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4578680992126465},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4395427107810974},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4277886152267456},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.413895845413208},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4132731854915619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3912324011325836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34893280267715454},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3352864384651184},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2153306007385254},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11570996046066284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834770","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834770","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":19,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W1550367722","https://openalex.org/W1667880265","https://openalex.org/W1965275036","https://openalex.org/W2017429418","https://openalex.org/W2099727759","https://openalex.org/W2100123008","https://openalex.org/W2150802958","https://openalex.org/W2520683369","https://openalex.org/W2784049966","https://openalex.org/W2951786898","https://openalex.org/W2986959318","https://openalex.org/W3198948488","https://openalex.org/W4289763265","https://openalex.org/W6606175091","https://openalex.org/W6654987763","https://openalex.org/W6748019508","https://openalex.org/W6754296366","https://openalex.org/W6770380337"],"related_works":["https://openalex.org/W2058933018","https://openalex.org/W4247927056","https://openalex.org/W2079095254","https://openalex.org/W2001137930","https://openalex.org/W3045986722","https://openalex.org/W2075924030","https://openalex.org/W1981702746","https://openalex.org/W2034718882","https://openalex.org/W1750254853","https://openalex.org/W58580312"],"abstract_inverted_index":{"A":[0],"quasi-dyadic":[1],"(QD)":[2],"parity":[3,10],"check":[4,11],"code":[5,8,66],"is":[6,14,49],"a":[7],"whose":[9],"matrix":[12],"representation":[13],"block":[15,48],"structured":[16],"with":[17],"dyadic":[18],"matrices":[19],"as":[20,86,88],"blocks.":[21],"Depending":[22],"on":[23],"the":[24,30],"number":[25],"of":[26,33,68,79],"nonzero":[27],"positions":[28],"in":[29,81],"leading":[31],"row":[32],"each":[34,47],"block,":[35],"these":[36],"codes":[37,53,74],"may":[38],"be":[39,78],"either":[40],"low":[41],"density":[42],"or":[43],"moderate":[44],"density.":[45],"Moreover,":[46],"reproducible,":[50],"giving":[51],"QD":[52],"advantages":[54],"similar":[55],"to":[56,77,92],"quasi-cyclic":[57],"(QC)":[58],"codes.":[59,72],"In":[60],"this":[61],"paper":[62],"we":[63],"examine":[64],"basic":[65],"properties":[67],"QD-LDPC":[69],"and":[70],"QD-MDPC":[71],"These":[73],"have":[75],"potential":[76],"use":[80],"standard":[82],"error":[83],"correction":[84],"applications":[85],"well":[87],"code-based":[89],"cryptography":[90],"due":[91],"their":[93],"smaller":[94],"key":[95],"size.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}