{"id":"https://openalex.org/W2016208252","doi":"https://doi.org/10.1109/tit.1972.1054822","title":"A note on the minimum distance structure of cyclic codes (Corresp.)","display_name":"A note on the minimum distance structure of cyclic codes (Corresp.)","publication_year":1972,"publication_date":"1972-05-01","ids":{"openalex":"https://openalex.org/W2016208252","doi":"https://doi.org/10.1109/tit.1972.1054822","mag":"2016208252"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1972.1054822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054822","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/A5111947581","display_name":"C. Hartmann","orcid":"https://orcid.org/0009-0007-5067-589X"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Hartmann","raw_affiliation_strings":["Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","Svstems and Information Science, Syracuse University, Syracuse, NY, USA"],"affiliations":[{"raw_affiliation_string":"Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Svstems and Information Science, Syracuse University, Syracuse, NY, USA","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111947581"],"corresponding_institution_ids":["https://openalex.org/I157725225","https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":1.5431,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8658849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"3","first_page":"439","last_page":"440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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.9534000158309937,"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/T13779","display_name":"Cancer Mechanisms and Therapy","score":0.9452999830245972,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.8317344784736633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6233997344970703},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.5461704134941101},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4876762628555298},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45480817556381226},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.4453132748603821},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44449129700660706},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.41609278321266174},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.34612980484962463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3101213574409485},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2848714292049408},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1780160367488861},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06559455394744873}],"concepts":[{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.8317344784736633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6233997344970703},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.5461704134941101},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4876762628555298},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45480817556381226},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.4453132748603821},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44449129700660706},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.41609278321266174},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.34612980484962463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3101213574409485},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2848714292049408},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1780160367488861},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06559455394744873}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1972.1054822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054822","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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1994883201","https://openalex.org/W2068933160","https://openalex.org/W2071375432","https://openalex.org/W2107986584","https://openalex.org/W2609374073","https://openalex.org/W3148275288","https://openalex.org/W4212825216"],"related_works":["https://openalex.org/W2141158404","https://openalex.org/W1995463680","https://openalex.org/W197575802","https://openalex.org/W4248511311","https://openalex.org/W4312394523","https://openalex.org/W757894748","https://openalex.org/W2111330432","https://openalex.org/W4387721160","https://openalex.org/W2049128002","https://openalex.org/W4365506134"],"abstract_inverted_index":{"In":[0],"this":[1],"correspondence":[2],"the":[3,18,25],"Mattson-Solomon":[4],"formulation":[5],"is":[6],"applied":[7],"to":[8],"cyclic":[9,30],"codes":[10,31],"with":[11],"multiple":[12],"sets":[13],"of":[14,17,24,28],"consecutive":[15],"roots":[16],"generator":[19],"polynomial":[20],"and":[21],"better":[22],"estimates":[23],"minimum":[26],"distance":[27],"many":[29],"are":[32],"obtained.":[33]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}