{"id":"https://openalex.org/W2139895623","doi":"https://doi.org/10.1109/tit.1970.1054526","title":"A recent result concerning the dual of polynomial codes (Corresp.)","display_name":"A recent result concerning the dual of polynomial codes (Corresp.)","publication_year":1970,"publication_date":"1970-09-01","ids":{"openalex":"https://openalex.org/W2139895623","doi":"https://doi.org/10.1109/tit.1970.1054526","mag":"2139895623"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1970.1054526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1970.1054526","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/A5066462638","display_name":"A.B. Cooper","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Cooper","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089639236","display_name":"W. Gore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. Gore","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4261,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.92473118,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"5","first_page":"638","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9986000061035156,"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.9986000061035156,"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.9472000002861023,"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/bch-code","display_name":"BCH code","score":0.9454371929168701},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.630314290523529},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6232069134712219},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.548150360584259},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.519180178642273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5158538222312927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4650612473487854},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.4639740586280823},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.46153151988983154},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.419243186712265},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41899290680885315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3536679744720459},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24219056963920593},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.23644667863845825},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20704150199890137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20143452286720276},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17798465490341187},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06673043966293335}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.9454371929168701},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.630314290523529},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6232069134712219},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.548150360584259},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.519180178642273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5158538222312927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4650612473487854},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.4639740586280823},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.46153151988983154},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.419243186712265},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41899290680885315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3536679744720459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24219056963920593},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.23644667863845825},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20704150199890137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20143452286720276},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17798465490341187},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06673043966293335},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1970.1054526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1970.1054526","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":1,"referenced_works":["https://openalex.org/W2087888940"],"related_works":["https://openalex.org/W153838523","https://openalex.org/W2129090975","https://openalex.org/W1497538254","https://openalex.org/W2092009244","https://openalex.org/W2366009615","https://openalex.org/W4254406877","https://openalex.org/W2201513181","https://openalex.org/W2556419737","https://openalex.org/W2054840915","https://openalex.org/W2484855765"],"abstract_inverted_index":{"A":[0],"recent":[1],"paper":[2],"on":[3,65],"polynomial":[4,20],"codes[l]":[5],"presented":[6],"an":[7],"important":[8],"theorem":[9,31,41],"concerning":[10],"the":[11,16,30,40,57,66,71],"BCH":[12,63],"minimum-distance":[13],"bound":[14,64],"for":[15],"dual":[17],"of":[18,26,39,50,59],"a":[19,23,36,48],"code.":[21],"For":[22],"particular":[24],"set":[25],"numerical":[27],"examples,":[28],"however,":[29,69],"failed.":[32],"This":[33],"correspondence":[34],"presents":[35],"modified":[37],"version":[38],"that":[42],"covers":[43],"those":[44],"cases":[45],"and":[46],"uses":[47],"method":[49],"proof,":[51],"which,":[52],"while":[53],"rigorous,":[54],"shows":[55],"clearly":[56],"significance":[58],"certain":[60],"concepts.":[61],"The":[62],"minimum":[67],"distance,":[68],"remains":[70],"same.":[72]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}