{"id":"https://openalex.org/W2004970940","doi":"https://doi.org/10.1109/tit.1983.1056672","title":"A new lower bound for the minimum distance of a cyclic code","display_name":"A new lower bound for the minimum distance of a cyclic code","publication_year":1983,"publication_date":"1983-05-01","ids":{"openalex":"https://openalex.org/W2004970940","doi":"https://doi.org/10.1109/tit.1983.1056672","mag":"2004970940"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056672","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056672","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5016932102","display_name":"C. Roos","orcid":"https://orcid.org/0000-0002-7963-9127"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"C. Roos","raw_affiliation_strings":["Department of Mathematics and Information, University of Technology, Delft, Netherlands","[Department of Mathematics and Information, University of Technology, Delft, Netherlands]"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Information, University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"[Department of Mathematics and Information, University of Technology, Delft, Netherlands]","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016932102"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":4.6513,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.94702966,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"3","first_page":"330","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9983999729156494,"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":0.9983999729156494,"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/T13779","display_name":"Cancer Mechanisms and Therapy","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2734","display_name":"Pathology and Forensic Medicine"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12505","display_name":"Peptidase Inhibition and Analysis","score":0.9470000267028809,"subfield":{"id":"https://openalex.org/subfields/2730","display_name":"Oncology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8327709436416626},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7722070217132568},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.6916913986206055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6183733940124512},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.611598789691925},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5021388530731201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49712589383125305},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4634212553501129},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2717205882072449},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2702982723712921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2315816581249237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21437886357307434},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1617436408996582}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8327709436416626},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7722070217132568},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.6916913986206055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6183733940124512},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.611598789691925},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5021388530731201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49712589383125305},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4634212553501129},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2717205882072449},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2702982723712921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2315816581249237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21437886357307434},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1617436408996582},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"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/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/tit.1983.1056672","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056672","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1589190557","https://openalex.org/W1606480398","https://openalex.org/W2002343488","https://openalex.org/W2039541047","https://openalex.org/W2051788381","https://openalex.org/W2066583820","https://openalex.org/W2083774980","https://openalex.org/W2182112064","https://openalex.org/W2809548040","https://openalex.org/W3216147140","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W2039750302","https://openalex.org/W1986274407","https://openalex.org/W2896263022","https://openalex.org/W2171753105","https://openalex.org/W2129090975","https://openalex.org/W75215367","https://openalex.org/W3127046705","https://openalex.org/W2164604678","https://openalex.org/W2366009615","https://openalex.org/W2550687679"],"abstract_inverted_index":{"A":[0],"new":[1,37],"lower":[2],"bound":[3,23,28,38],"for":[4,34],"the":[5,20,25,36,49],"minimum":[6],"distance":[7],"of":[8],"a":[9],"linear":[10],"code":[11],"is":[12,39],"derived.":[13],"When":[14],"applied":[15],"to":[16,41,48],"cyclic":[17],"codes":[18],"both":[19],"Bose-Chaudhuri-Hocquenghem":[21],"(BCH)":[22],"and":[24],"Hartmann-Tzeng":[26],"(HT)":[27],"are":[29,52],"obtained":[30],"as":[31,45,47],"corollaries.":[32],"Examples":[33],"which":[35],"superior":[40],"these":[42],"two":[43],"bounds,":[44],"well":[46],"Carlitz-Uchiyama":[50],"bound,":[51],"given.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}