{"id":"https://openalex.org/W2056845292","doi":"https://doi.org/10.1109/tit.1983.1056666","title":"Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials","display_name":"Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials","publication_year":1983,"publication_date":"1983-05-01","ids":{"openalex":"https://openalex.org/W2056845292","doi":"https://doi.org/10.1109/tit.1983.1056666","mag":"2056845292"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056666","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/A5079990150","display_name":"Paul Camion","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"P. Camion","raw_affiliation_strings":["Institut National de Recherche en Informatique et Automatique, France","[Institut National de Recherche en Informatique et Automatique, France]"],"affiliations":[{"raw_affiliation_string":"Institut National de Recherche en Informatique et Automatique, France","institution_ids":["https://openalex.org/I4210115519"]},{"raw_affiliation_string":"[Institut National de Recherche en Informatique et Automatique, France]","institution_ids":["https://openalex.org/I4210115519"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079990150"],"corresponding_institution_ids":["https://openalex.org/I4210115519"],"apc_list":null,"apc_paid":null,"fwci":3.1009,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.92371923,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"3","first_page":"378","last_page":"385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9943000078201294,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/algorithm","display_name":"Algorithm","score":0.5379133820533752},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5252337455749512},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48979616165161133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42119839787483215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4024260640144348},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3905770778656006},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38542231917381287},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.16419479250907898}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5379133820533752},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5252337455749512},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48979616165161133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42119839787483215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4024260640144348},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3905770778656006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38542231917381287},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.16419479250907898},{"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.1056666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056666","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":12,"referenced_works":["https://openalex.org/W1489273657","https://openalex.org/W1606480398","https://openalex.org/W1973452640","https://openalex.org/W1995229050","https://openalex.org/W2040169645","https://openalex.org/W2055762904","https://openalex.org/W2113600343","https://openalex.org/W2210707037","https://openalex.org/W2996335208","https://openalex.org/W3021014091","https://openalex.org/W3145362385","https://openalex.org/W4231018896"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2980963558","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2062023542"],"abstract_inverted_index":{"Let":[0],"<tex":[1,19,24,32,103,145,151,159,179],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,20,25,33,104,146,152,160,180],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">f(x)\\in":[3],"{\\bf":[4],"F}_{q}[X]</tex>":[5,148],"be":[6,13],"a":[7,76,95,121],"polynomial":[8],"with":[9,120],"simple":[10],"roots":[11],"to":[12,55,93,174],"factored.":[14],"The":[15,73,112],"so-called":[16],"Berlekamp":[17],"subalgebra":[18],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">B</tex>":[21],"spanned":[22],"over":[23],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">{\\bf":[26,105,147],"F}_{q}</tex>":[27,106],"by":[28,124],"the":[29,61,84,129,165,170],"idempotents":[30,57],"of":[31,63,75,79,102,132,144,149,158,177],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">A={\\bf":[34],"F}_{q}[X]/(f(X))</tex>":[35],"is":[36,43,67,81,91,138,169],"considered.":[37],"An":[38],"exponential":[39],"technique":[40],"introduced":[41,82,123,139],"earlier":[42],"based":[44],"upon":[45],"taking":[46],"elements":[47],"from":[48,59],"B":[49,80,90],"at":[50],"random":[51],"and":[52,83,109,114],"enables":[53],"us":[54],"obtain":[56],"and,":[58],"that,":[60],"factors":[62],"f(X).":[64],"This":[65],"algorithm":[66,113,137,172],"speeded":[68],"up":[69],"in":[70,163],"three":[71],"ways.":[72],"concept":[74],"separating":[77,97],"subset":[78],"McEliece":[85],"operator":[86],"mapping":[87],"A":[88],"onto":[89],"used":[92,118],"construct":[94],"small":[96],"set.":[98],"{\\em":[99],"Factoring}":[100],"subsets":[101,116],"were":[107],"defined":[108],"investigated":[110],"previously.":[111],"these":[115],"are":[117],"together":[119],"process":[122],"F.":[125],"J.":[126],"McWilliams":[127],"for":[128,140,155],"rapid":[130],"construction":[131],"primitive":[133],"idempotents.":[134],"Finally,":[135],"an":[136],"constructing":[141],"irreducible":[142],"polynomials":[143,176],"degree":[150,178],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</tex>":[153,161],",":[154,162],"large":[156],"values":[157],"which":[164],"most":[166],"expensive":[167],"operation":[168],"Euclidian":[171],"applied":[173],"two":[175],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2d</tex>":[181],".":[182]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}