{"id":"https://openalex.org/W4289655219","doi":"https://doi.org/10.1109/isit50566.2022.9834653","title":"Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes","display_name":"Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655219","doi":"https://doi.org/10.1109/isit50566.2022.9834653"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834653","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5089300685","display_name":"Henk D. L. Hollmann","orcid":"https://orcid.org/0000-0003-4005-2369"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":true,"raw_author_name":"Henk D. L. Hollmann","raw_affiliation_strings":["University of Tartu,Institute of Computer Science,Tartu,Estonia,51009"],"affiliations":[{"raw_affiliation_string":"University of Tartu,Institute of Computer Science,Tartu,Estonia,51009","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089300685"],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0625404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1981","last_page":"1986"},"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/T10849","display_name":"Finite Group Theory Research","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9765999913215637,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/automorphism","display_name":"Automorphism","score":0.7676944136619568},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6492937803268433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4791240692138672},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4158513844013214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30909907817840576},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.0679788887500763},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.06268376111984253}],"concepts":[{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.7676944136619568},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6492937803268433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4791240692138672},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4158513844013214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30909907817840576},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0679788887500763},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.06268376111984253}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834653","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W5674887","https://openalex.org/W1506076469","https://openalex.org/W2048465688","https://openalex.org/W2062938517","https://openalex.org/W2065465262","https://openalex.org/W2093962799","https://openalex.org/W2149880093","https://openalex.org/W2274345442","https://openalex.org/W3152391244","https://openalex.org/W4210773536","https://openalex.org/W4212889549","https://openalex.org/W4313479007","https://openalex.org/W6600235561","https://openalex.org/W6628614173","https://openalex.org/W6636396655","https://openalex.org/W6849149324"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W161787318","https://openalex.org/W2998724919","https://openalex.org/W2007980826","https://openalex.org/W1997883919","https://openalex.org/W2042372008","https://openalex.org/W2376326551","https://openalex.org/W2061531152"],"abstract_inverted_index":{"Let":[0],"${{\\mathcal{U}}_n}$":[1,60,80],"be":[2,67,204],"the":[3,10,29,89,113,118,122,132,211],"multiplicative":[4],"group":[5],"of":[6,14,28,63,102,157,169,179,200],"order":[7],"n":[8,104],"in":[9,83,166,206],"splitting":[11],"field":[12,24],"${{\\mathbb{F}}_{{q^m}}}$":[13,57,78],"x":[15,31],"<sup":[16,34,45],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[17,35,46],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[18],"\u2212":[19],"1":[20],"over":[21,105],"a":[22,158,167],"finite":[23],"${{\\mathbb{F}}_q}$.":[25],"Any":[26],"map":[27],"form":[30],"\u2192":[32],"cx":[33],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</sup>":[36],"with":[37],"$c":[38],"\\in":[39],"{{\\mathcal{U}}_n}$":[40],"and":[41,58,82,121,173,181,186,219],"t":[42],"=":[43],"q":[44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sup>":[47],",":[48],"0":[49],"\u2264":[50],"i":[51],"<":[52],"m,":[53],"is":[54,93,136],"${{\\mathbb{F}}_q}$-linear":[55,75],"on":[56,77],"fixes":[59],"set-wise;":[61],"maps":[62,76],"this":[64,207,214],"type":[65],"will":[66],"called":[68,184],"standard.":[69],"Occasionally":[70],"there":[71],"are":[72],"other,":[73],"non-standard":[74,146,159],"fixing":[79],"set-wise,":[81],"that":[84,88,97,125,156,197],"case":[85,215],"we":[86,138,151],"say":[87],"pair":[90,133],"(n,":[91,134],"q)":[92,135],"non-standard.":[94],"We":[95,175,195],"show":[96,196],"an":[98],"irreducible":[99,142],"cyclic":[100,119,143],"code":[101,128],"length":[103],"${{\\mathbb{F}}_q}$":[106],"has":[107],"\u201cextra\u201d":[108],"permutation":[109],"automorphisms":[110],"(others":[111],"than":[112],"standard":[114],"permutations":[115],"generated":[116],"by":[117,171,217],"shift":[120],"Frobenius":[123],"mapping":[124],"every":[126],"such":[127,141],"has)":[129],"precisely":[130],"when":[131],"non-standard;":[137],"refer":[139],"to":[140,155,188],"codes":[144],"as":[145,164],"or":[147],"NSIC-codes.":[148],"In":[149],"addition,":[150],"relate":[152],"these":[153],"concepts":[154],"linear":[160],"recurring":[161],"sequence":[162,168],"subgroup":[163],"investigated":[165],"papers":[170],"Brison":[172,218],"Nogueira.":[174,220],"present":[176],"several":[177],"families":[178],"NSIC-codes,":[180],"two":[182,202],"constructions":[183],"\u201clifting\u201d":[185],"\u201cextension\u201d":[187],"create":[189],"new":[190],"NSIC-codes":[191,199],"from":[192],"existing":[193],"ones.":[194],"all":[198],"dimension":[201],"can":[203],"obtained":[205],"way,":[208],"thus":[209],"completing":[210],"classification":[212],"for":[213],"started":[216]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}