{"id":"https://openalex.org/W1965918218","doi":"https://doi.org/10.1109/isit.2013.6620353","title":"Generalised Multi-sequence Shift-Register synthesis using module minimisation","display_name":"Generalised Multi-sequence Shift-Register synthesis using module minimisation","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1965918218","doi":"https://doi.org/10.1109/isit.2013.6620353","mag":"1965918218"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5042242064","display_name":"Johan Rosenkilde","orcid":"https://orcid.org/0000-0002-3540-0456"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Johan S. R. Nielsen","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, Denmark","Department of Applied Mathematics and Computer Science Technical University of Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science Technical University of Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042242064"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":3.9539,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.9339595,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"882","last_page":"886"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9962999820709229,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9940999746322632,"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/minimisation","display_name":"Minimisation (clinical trials)","score":0.9134910106658936},{"id":"https://openalex.org/keywords/shift-register","display_name":"Shift register","score":0.743492066860199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6593548059463501},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6398454904556274},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5553386807441711},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5518230199813843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5209368467330933},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3685486316680908},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3314666748046875},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32978516817092896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2387007772922516},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06978809833526611}],"concepts":[{"id":"https://openalex.org/C86941820","wikidata":"https://www.wikidata.org/wiki/Q6865391","display_name":"Minimisation (clinical trials)","level":2,"score":0.9134910106658936},{"id":"https://openalex.org/C49654631","wikidata":"https://www.wikidata.org/wiki/Q746165","display_name":"Shift register","level":3,"score":0.743492066860199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6593548059463501},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6398454904556274},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5553386807441711},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5518230199813843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5209368467330933},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3685486316680908},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3314666748046875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32978516817092896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2387007772922516},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06978809833526611},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C165005293","wikidata":"https://www.wikidata.org/wiki/Q1074500","display_name":"Chip","level":2,"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/isit.2013.6620353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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":21,"referenced_works":["https://openalex.org/W966573063","https://openalex.org/W1562183207","https://openalex.org/W1994728957","https://openalex.org/W2006272675","https://openalex.org/W2043216985","https://openalex.org/W2064980599","https://openalex.org/W2071184318","https://openalex.org/W2105294563","https://openalex.org/W2113672208","https://openalex.org/W2122064826","https://openalex.org/W2132376394","https://openalex.org/W2145738710","https://openalex.org/W2147544637","https://openalex.org/W2158558186","https://openalex.org/W2165737598","https://openalex.org/W2745946521","https://openalex.org/W3005753757","https://openalex.org/W3102517494","https://openalex.org/W6666513432","https://openalex.org/W6682167346","https://openalex.org/W6774086795"],"related_works":["https://openalex.org/W2011109452","https://openalex.org/W2077098439","https://openalex.org/W2086614003","https://openalex.org/W2058883719","https://openalex.org/W2048794281","https://openalex.org/W2051185874","https://openalex.org/W2111330731","https://openalex.org/W1965918218","https://openalex.org/W2494420798","https://openalex.org/W4250137176"],"abstract_inverted_index":{"We":[0,23,83],"show":[1,24,41],"how":[2,25,42],"to":[3,89],"solve":[4],"a":[5,91],"generalised":[6,87],"version":[7],"of":[8,18,44,57],"the":[9,58,67,70],"Multi-sequence":[10],"Linear":[11],"Feedback":[12],"Shift-Register":[13],"(MLFSR)":[14],"problem":[15],"using":[16],"minimisation":[17],"free":[19],"modules":[20,32],"over":[21],"F[x].":[22],"two":[26],"existing":[27],"algorithms":[28,74],"for":[29,51,96],"minimising":[30],"such":[31],"run":[33],"particularly":[34],"fast":[35,77,93],"on":[36],"these":[37,73],"instances.":[38],"Furthermore,":[39],"we":[40],"one":[43],"them":[45],"can":[46],"be":[47],"made":[48],"even":[49],"faster":[50],"our":[52,55,86],"use.":[53],"With":[54],"modelling":[56],"problem,":[59],"classical":[60],"algebraic":[61],"results":[62],"tremendously":[63],"simplify":[64],"arguing":[65],"about":[66],"algorithms.":[68],"For":[69],"non-generalised":[71],"MLFSR,":[72],"are":[75],"as":[76,78],"what":[79],"is":[80],"currently":[81],"known.":[82],"then":[84],"use":[85],"MLFSR":[88],"give":[90],"new":[92],"decoding":[94],"algorithm":[95],"Reed":[97],"Solomon":[98],"codes.":[99]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}
