{"id":"https://openalex.org/W1674043613","doi":"https://doi.org/10.1109/isit.2015.7282984","title":"An upper bound on the minimum distance of LDPC codes over GF(q)","display_name":"An upper bound on the minimum distance of LDPC codes over GF(q)","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1674043613","doi":"https://doi.org/10.1109/isit.2015.7282984","mag":"1674043613"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282984","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5008712753","display_name":"Alexey Frolov","orcid":"https://orcid.org/0000-0002-6734-0179"},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210097085","https://openalex.org/I4210107660"]},{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexey Frolov","raw_affiliation_strings":["Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia","Institute for Information Transmission Problems,Russian Academy of Sciences,Moscow,Russia"],"affiliations":[{"raw_affiliation_string":"Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia","institution_ids":["https://openalex.org/I4210107660"]},{"raw_affiliation_string":"Institute for Information Transmission Problems,Russian Academy of Sciences,Moscow,Russia","institution_ids":["https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008712753"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210107660"],"apc_list":null,"apc_paid":null,"fwci":1.3313,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82605297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"2885","last_page":"2888"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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.9990000128746033,"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.8693128228187561},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8139604926109314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6024757623672485},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5445809364318848},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5286738872528076},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5155563354492188},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48332926630973816},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3889242112636566},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.28971385955810547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2290906012058258}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8693128228187561},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8139604926109314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6024757623672485},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5445809364318848},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5286738872528076},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5155563354492188},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48332926630973816},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3889242112636566},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28971385955810547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2290906012058258},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282984","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282984","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.44999998807907104,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2034215849","https://openalex.org/W2081749849","https://openalex.org/W2114664801","https://openalex.org/W2128765501","https://openalex.org/W2130458083","https://openalex.org/W2131486878","https://openalex.org/W2133068391","https://openalex.org/W2170758137","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2167124952","https://openalex.org/W2011293233","https://openalex.org/W2169710030","https://openalex.org/W4388717827","https://openalex.org/W2065071381","https://openalex.org/W2124450281"],"abstract_inverted_index":{"In":[0,19],"[1]":[1],"a":[2],"syndrome":[3],"counting":[4],"based":[5],"upper":[6,51],"bound":[7,25,42,52,60,68],"on":[8],"the":[9,24,27,40,50,66],"minimum":[10],"distance":[11],"of":[12,29],"regular":[13],"binary":[14],"LDPC":[15,33,44],"codes":[16,34,45,55],"is":[17,56,61],"given.":[18],"this":[20],"paper":[21],"we":[22],"extend":[23],"to":[26,39,49,63],"case":[28],"irregular":[30],"and":[31,48],"generalized":[32],"over":[35,46],"GF(q).":[36],"The":[37,58],"comparison":[38],"lower":[41],"for":[43,53],"GF(q)":[47],"non-binary":[54],"done.":[57],"new":[59],"shown":[62],"lie":[64],"under":[65],"Gilbert-Varshamov":[67],"at":[69],"high":[70],"rates.":[71]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}