{"id":"https://openalex.org/W4312449659","doi":"https://doi.org/10.1109/iscas48785.2022.9937668","title":"Efficient Nested Key Equation Solver for Short Generalized Integrated Interleaved BCH Codes","display_name":"Efficient Nested Key Equation Solver for Short Generalized Integrated Interleaved BCH Codes","publication_year":2022,"publication_date":"2022-05-28","ids":{"openalex":"https://openalex.org/W4312449659","doi":"https://doi.org/10.1109/iscas48785.2022.9937668"},"language":"en","primary_location":{"id":"doi:10.1109/iscas48785.2022.9937668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5033531436","display_name":"Zhenshan Xie","orcid":"https://orcid.org/0000-0003-1594-4891"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhenshan Xie","raw_affiliation_strings":["The Ohio State University,Dept. of Electrical and Computer Engineering,Columbus,USA,OH 43210"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Dept. of Electrical and Computer Engineering,Columbus,USA,OH 43210","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063673084","display_name":"Xinmiao Zhang","orcid":"https://orcid.org/0000-0002-8289-2377"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xinmiao Zhang","raw_affiliation_strings":["The Ohio State University,Dept. of Electrical and Computer Engineering,Columbus,USA,OH 43210"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Dept. of Electrical and Computer Engineering,Columbus,USA,OH 43210","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.3362,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56721438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2067","last_page":"2071"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"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/bch-code","display_name":"BCH code","score":0.7854770421981812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6624244451522827},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5620515942573547},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5180930495262146},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4948684573173523},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.45725908875465393},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.41212183237075806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40822815895080566},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35846492648124695}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7854770421981812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6624244451522827},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5620515942573547},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5180930495262146},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4948684573173523},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.45725908875465393},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.41212183237075806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40822815895080566},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35846492648124695},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas48785.2022.9937668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2075850503","https://openalex.org/W2123307753","https://openalex.org/W2557281395","https://openalex.org/W2941076309","https://openalex.org/W2952622859","https://openalex.org/W3005429726","https://openalex.org/W3035111722","https://openalex.org/W3162488502","https://openalex.org/W4236851168"],"related_works":["https://openalex.org/W2912502034","https://openalex.org/W2319574489","https://openalex.org/W2035908476","https://openalex.org/W2506979107","https://openalex.org/W4239727543","https://openalex.org/W2612882049","https://openalex.org/W2284101512","https://openalex.org/W1604083761","https://openalex.org/W2262711716","https://openalex.org/W4285217179"],"abstract_inverted_index":{"Generalized":[0],"integrated":[1],"interleaved":[2],"(GII)":[3],"codes":[4],"can":[5],"nest":[6],"BCH":[7,12],"sub-codewords":[8],"to":[9,105,119,167],"form":[10],"stronger":[11],"codewords.":[13],"They":[14],"are":[15],"among":[16],"the":[17,24,42,82,107,115,121,144,157,162],"best":[18],"candidates":[19],"for":[20,93],"error":[21],"correction":[22],"in":[23,53,67],"new":[25],"storage":[26],"class":[27],"memories":[28],"(SCMs).":[29],"However,":[30],"SCMs":[31],"require":[32],"short":[33,94],"codeword":[34],"length":[35],"and":[36,75,153],"low":[37],"redundancy.":[38],"In":[39],"this":[40],"case,":[41],"nested":[43,69,90,163],"key":[44,51],"equation":[45],"solver":[46],"(KES),":[47],"which":[48],"is":[49,100,117],"a":[50,57],"step":[52],"GII":[54],"decoding,":[55],"has":[56],"small":[58],"number":[59,122],"of":[60,123],"iterations.":[61],"The":[62,97],"initialization":[63],"and/or":[64],"scalar":[65,112],"pre-computation":[66],"previous":[68],"KES":[70,91,116],"designs":[71],"have":[72],"large":[73],"area":[74,129,151],"may":[76],"take":[77],"even":[78],"longer":[79],"time":[80],"than":[81],"iterations":[83],"themselves.":[84],"This":[85],"paper":[86],"proposes":[87],"an":[88,132],"efficient":[89],"design":[92,146],"GII-BCH":[95],"codes.":[96],"polynomial":[98],"updating":[99],"decomposed":[101],"into":[102],"two":[103],"steps":[104],"reduce":[106,120],"critical":[108],"path":[109],"without":[110,126],"requiring":[111],"pre-computation.":[113],"Besides,":[114],"reformulated":[118],"clock":[124],"cycles":[125],"incurring":[127],"any":[128],"overhead.":[130],"For":[131],"example":[133],"code":[134],"over":[135,161],"$GF(2^{10})$":[136],"that":[137],"protects":[138],"2560":[139],"bits":[140],"with":[141],"10%":[142],"redundancy,":[143],"proposed":[145],"achieves":[147],"at":[148],"least":[149],"25%":[150],"reduction":[152,155],"37%":[154],"on":[156],"area-time":[158],"product":[159],"averaged":[160],"decoding":[164],"rounds":[165],"compared":[166],"prior":[168],"efforts.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}