{"id":"https://openalex.org/W2162442687","doi":"https://doi.org/10.1109/tit.1969.1054260","title":"Shift-register synthesis and BCH decoding","display_name":"Shift-register synthesis and BCH decoding","publication_year":1969,"publication_date":"1969-01-01","ids":{"openalex":"https://openalex.org/W2162442687","doi":"https://doi.org/10.1109/tit.1969.1054260","mag":"2162442687"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054260","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054260","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/A5089069520","display_name":"J. Massey","orcid":"https://orcid.org/0000-0002-7793-7008"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Massey","raw_affiliation_strings":["University of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089069520"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":12.7863,"has_fulltext":false,"cited_by_count":2169,"citation_normalized_percentile":{"value":0.9857617,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"15","issue":"1","first_page":"122","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"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/bch-code","display_name":"BCH code","score":0.9080096483230591},{"id":"https://openalex.org/keywords/shift-register","display_name":"Shift register","score":0.844326376914978},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.8200814723968506},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7073618173599243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564582884311676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5415710210800171},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5087664723396301},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42750129103660583},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.41465461254119873},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3522711992263794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34238749742507935},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.28992074728012085},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25772804021835327},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07561495900154114}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.9080096483230591},{"id":"https://openalex.org/C49654631","wikidata":"https://www.wikidata.org/wiki/Q746165","display_name":"Shift register","level":3,"score":0.844326376914978},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.8200814723968506},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7073618173599243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564582884311676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5415710210800171},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5087664723396301},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42750129103660583},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.41465461254119873},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3522711992263794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34238749742507935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28992074728012085},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25772804021835327},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07561495900154114},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1969.1054260","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054260","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":6,"referenced_works":["https://openalex.org/W1594652978","https://openalex.org/W1965483199","https://openalex.org/W2048731540","https://openalex.org/W2134732546","https://openalex.org/W2153936403","https://openalex.org/W2334439626"],"related_works":["https://openalex.org/W1992183350","https://openalex.org/W2066795426","https://openalex.org/W1995527419","https://openalex.org/W2361034356","https://openalex.org/W3021984762","https://openalex.org/W2915572277","https://openalex.org/W2070284141","https://openalex.org/W1978637058","https://openalex.org/W4244153028","https://openalex.org/W2521769401"],"abstract_inverted_index":{"It":[0],"is":[1,79],"shown":[2],"in":[3],"this":[4],"paper":[5],"that":[6],"the":[7,23,27,51,54,68,85],"iterative":[8],"algorithm":[9,55,86],"introduced":[10],"by":[11],"Berlekamp":[12],"for":[13,71,84],"decoding":[14,69],"BCH":[15,72],"codes":[16,73],"actually":[17],"provides":[18],"a":[19,36,47,75],"general":[20],"solution":[21],"to":[22,46,74],"problem":[24,70,78],"of":[25,34,40,50,53,67],"synthesizing":[26],"shortest":[28],"linear":[29],"feedback":[30],"shift":[31],"register":[32],"capable":[33],"generating":[35],"prescribed":[37],"finite":[38],"sequence":[39],"digits.":[41],"The":[42,65],"shift-register":[43,76],"approach":[44],"leads":[45],"simple":[48],"proof":[49],"validity":[52],"as":[56,58],"well":[57],"providing":[59],"additional":[60],"insight":[61],"into":[62],"its":[63],"properties.":[64],"equivalence":[66],"synthesis":[77],"demonstrated,":[80],"and":[81],"other":[82],"applications":[83],"are":[87],"suggested.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":43},{"year":2024,"cited_by_count":49},{"year":2023,"cited_by_count":50},{"year":2022,"cited_by_count":52},{"year":2021,"cited_by_count":62},{"year":2020,"cited_by_count":67},{"year":2019,"cited_by_count":70},{"year":2018,"cited_by_count":67},{"year":2017,"cited_by_count":81},{"year":2016,"cited_by_count":76},{"year":2015,"cited_by_count":89},{"year":2014,"cited_by_count":83},{"year":2013,"cited_by_count":103},{"year":2012,"cited_by_count":77}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}