{"id":"https://openalex.org/W2032523506","doi":"https://doi.org/10.1109/isit.2014.6875301","title":"Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance","display_name":"Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2032523506","doi":"https://doi.org/10.1109/isit.2014.6875301","mag":"2032523506"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1404.2819","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alexander Zeh","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Alexander Zeh","raw_affiliation_strings":["Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":null,"display_name":"San Ling","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"San Ling","raw_affiliation_strings":["Division of Mathematical Sciences, Nanyang Technological University Singapore, Republic of Singapore"],"affiliations":[{"raw_affiliation_string":"Division of Mathematical Sciences, Nanyang Technological University Singapore, Republic of Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.8487,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81132352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"2584","last_page":"2588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9965999722480774,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9936000108718872,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7645000219345093},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.7178000211715698},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6952000260353088},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6578999757766724},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5482000112533569},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5351999998092651},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.49160000681877136}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7645000219345093},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7178000211715698},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6952000260353088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6890000104904175},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6578999757766724},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5774999856948853},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5482000112533569},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5351999998092651},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5020999908447266},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.49160000681877136},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.49070000648498535},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.39010000228881836},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.37940001487731934},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3441999852657318},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33469998836517334},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.33469998836517334},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.3285999894142151},{"id":"https://openalex.org/C198082693","wikidata":"https://www.wikidata.org/wiki/Q1551631","display_name":"Gr\u00f6bner basis","level":3,"score":0.28780001401901245},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.27799999713897705},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.26910001039505005},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.26170000433921814}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6875301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1404.2819","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1404.2819","pdf_url":"https://arxiv.org/pdf/1404.2819","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:1404.2819","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1404.2819","pdf_url":"https://arxiv.org/pdf/1404.2819","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":19,"referenced_works":["https://openalex.org/W1969223581","https://openalex.org/W1995527419","https://openalex.org/W2005457258","https://openalex.org/W2039541047","https://openalex.org/W2062642782","https://openalex.org/W2062909403","https://openalex.org/W2071184318","https://openalex.org/W2083774980","https://openalex.org/W2085440372","https://openalex.org/W2095219683","https://openalex.org/W2105694437","https://openalex.org/W2111162716","https://openalex.org/W2125905426","https://openalex.org/W2131418871","https://openalex.org/W2138736362","https://openalex.org/W2158558186","https://openalex.org/W2160996071","https://openalex.org/W2162118201","https://openalex.org/W6630240052"],"related_works":[],"abstract_inverted_index":{"A":[0],"new":[1],"lower":[2],"bound":[3,28,36],"on":[4,21],"the":[5,26,34,38],"minimum":[6],"Hamming":[7],"distance":[8],"of":[9],"linear":[10],"quasi-cyclic":[11],"codes":[12],"over":[13],"finite":[14],"fields":[15],"is":[16,19,50],"proposed.":[17],"It":[18],"based":[20],"spectral":[22],"analysis":[23],"and":[24],"generalizes":[25],"Semenov-Trifonov":[27],"in":[29],"a":[30,45],"similar":[31],"way":[32],"as":[33],"Hartmann-Tzeng":[35],"extends":[37],"BCH":[39],"approach":[40],"for":[41],"cyclic":[42],"codes.":[43],"Furthermore,":[44],"syndrome-based":[46],"algebraic":[47],"decoding":[48],"algorithm":[49],"given.":[51]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}