{"id":"https://openalex.org/W2093443836","doi":"https://doi.org/10.1109/isqed.2012.6187474","title":"Low complexity cross parity codes for multiple and random bit error correction","display_name":"Low complexity cross parity codes for multiple and random bit error correction","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2093443836","doi":"https://doi.org/10.1109/isqed.2012.6187474","mag":"2093443836"},"language":"en","primary_location":{"id":"doi:10.1109/isqed.2012.6187474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2012.6187474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Symposium on Quality Electronic Design (ISQED)","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/A5022896061","display_name":"Mahesh Poolakkaparambil","orcid":null},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mahesh Poolakkaparambil","raw_affiliation_strings":["Department of Computer Science and Electronics, Oxford Brookes University, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081683515","display_name":"Jimson Mathew","orcid":"https://orcid.org/0000-0001-8247-9040"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jimson Mathew","raw_affiliation_strings":["Department of Computer Science, University of Bristol, UK","Department of Computer Science,  University of Bristol , UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science,  University of Bristol , UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076588539","display_name":"Abusaleh Jabir","orcid":null},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Abusaleh M. Jabir","raw_affiliation_strings":["Department of Computer Science and Electronics, Oxford Brookes University, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Electronics, Oxford Brookes University, UK","institution_ids":["https://openalex.org/I124261462"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070359867","display_name":"Saraju P. Mohanty","orcid":"https://orcid.org/0000-0003-2959-6541"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saraju P. Mohanty","raw_affiliation_strings":["Department of Computer Science and Engineering, University of North Texas, USA","Department of Computer Science and Engineering , University of North Texas , USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of North Texas, USA","institution_ids":["https://openalex.org/I123534392"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , University of North Texas , USA","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022896061"],"corresponding_institution_ids":["https://openalex.org/I124261462"],"apc_list":null,"apc_paid":null,"fwci":0.249,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.62182659,"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":"57","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9997000098228455,"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/T10951","display_name":"Cryptographic Implementations and Security","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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.6817503571510315},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.6485130786895752},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.6259587407112122},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5561947822570801},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.554917573928833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4990427494049072},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.46208593249320984},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.46097293496131897},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4388018846511841},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.42865562438964844},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2719597816467285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24897652864456177},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1398497223854065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12315025925636292}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6817503571510315},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.6485130786895752},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.6259587407112122},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5561947822570801},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.554917573928833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4990427494049072},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.46208593249320984},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.46097293496131897},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4388018846511841},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.42865562438964844},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2719597816467285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24897652864456177},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1398497223854065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12315025925636292}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isqed.2012.6187474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2012.6187474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Symposium on Quality Electronic Design (ISQED)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.920.5075","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.920.5075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Saraju_Mohanty/publication/260733401_Low_complexity_cross_parity_codes_for_multiple_and_random_bit_error_correction/links/54ce94890cf24601c091d8ca.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2014066342","https://openalex.org/W2032503658","https://openalex.org/W2042212802","https://openalex.org/W2050511120","https://openalex.org/W2059598692","https://openalex.org/W2066425771","https://openalex.org/W2077700112","https://openalex.org/W2103415152","https://openalex.org/W2104003712","https://openalex.org/W2104183585","https://openalex.org/W2120912790","https://openalex.org/W2129443786","https://openalex.org/W2139505930","https://openalex.org/W2149204794","https://openalex.org/W2159340382","https://openalex.org/W2169578979","https://openalex.org/W3117872938"],"related_works":["https://openalex.org/W2577537206","https://openalex.org/W2066694005","https://openalex.org/W1487439089","https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2779867339","https://openalex.org/W2794545997"],"abstract_inverted_index":{"Error":[0],"detection":[1],"and":[2,10,63,90,119,165,177,184,221],"correction":[3,117],"which":[4],"has":[5],"been":[6],"used":[7,57,192],"in":[8,17,73,115,129,216],"communication":[9],"memory":[11],"design":[12],"is":[13,132,159],"becoming":[14],"increasingly":[15],"important":[16],"fault":[18,67],"tolerant":[19],"logic":[20],"circuit":[21],"design.":[22],"As":[23],"a":[24,101,172,228],"result":[25],"of":[26,124,148,218,240],"the":[27,31,74,125,138,149,154,200,223,238,241],"aggressive":[28],"technology":[29],"scaling,":[30],"current":[32],"high-density":[33],"integrated":[34],"circuits":[35,76],"are":[36,77,203],"easily":[37],"succumbed":[38],"to":[39,69,207,227,237],"faulty":[40],"operations":[41],"generated":[42],"from":[43],"many":[44],"sources":[45],"including":[46],"stuck-at-faults,":[47],"radiation":[48],"induced":[49],"faults,":[50],"or":[51,83],"malicious":[52],"eavesdropper":[53],"attacks.":[54],"The":[55,121],"currently":[56],"techniques":[58],"like":[59],"low-density":[60],"parity-check":[61],"(LDPC)":[62],"Hamming":[64,162,181,213],"code":[65,104,164,170,183],"based":[66,92,105,214],"masking":[68],"mitigate":[70],"bit":[71,80],"flips":[72],"digital":[75],"either":[78],"single":[79],"error":[81,85,116,232],"correcting":[82],"multiple":[84,110,231],"correctable":[86,233],"with":[87,94,112],"Bose-Choudhury-Hocquenghem":[88],"(BCH)":[89],"Reed-solomon":[91],"methods":[93,151,202,215],"very":[95],"large":[96],"overheads.":[97],"This":[98],"paper":[99,131],"introduce":[100],"novel":[102,126],"cross":[103,163,169,182,188],"method":[106,127],"that":[107,133,153],"can":[108],"correct":[109,136],"errors":[111,139],"minimal":[113],"compromise":[114],"capability":[118],"area.":[120],"key":[122],"idea":[123],"proposed":[128,150,201],"this":[130],"do":[134],"not":[135],"all":[137],"but":[140],"minimize":[141],"their":[142],"probability":[143],"being":[144],"escaped.":[145],"Experimental":[146],"results":[147],"show":[152],"following:":[155],"(1)":[156],"area":[157,219],"overhead":[158,220],"101%":[160],"for":[161,167,171,180,186,190],"106%":[166],"BCH":[168,187],"90-bit":[173],"finite":[174],"field":[175],"multiplier":[176,236],"(2)":[178],"150%":[179],"170%":[185],"codes":[189],"practically":[191],"163-bit":[193],"digit":[194,234],"serial":[195,235],"polynomial":[196],"basis":[197],"multiplier.":[198],"Thus,":[199],"significantly":[204],"efficient":[205],"compared":[206],"Triple":[208],"Modular":[209],"Redundancy":[210],"(TMR),":[211],"LDPC,":[212],"terms":[217],"also":[222],"first":[224],"attempted":[225],"approach":[226],"low":[229],"complexity":[230],"best":[239],"authors":[242],"knowledge.":[243]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}