{"id":"https://openalex.org/W2103415152","doi":"https://doi.org/10.1109/tvlsi.2009.2036362","title":"Matrix Codes for Reliable and Cost Efficient Memory Chips","display_name":"Matrix Codes for Reliable and Cost Efficient Memory Chips","publication_year":2009,"publication_date":"2009-12-11","ids":{"openalex":"https://openalex.org/W2103415152","doi":"https://doi.org/10.1109/tvlsi.2009.2036362","mag":"2103415152"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2009.2036362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2009.2036362","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Very Large Scale Integration (VLSI) Systems","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/A5058001228","display_name":"Costas Argyrides","orcid":"https://orcid.org/0000-0002-9869-2345"},"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":"Costas Argyrides","raw_affiliation_strings":["Department of Computer Science, University of Bristol, Bristol, UK","Department of Computer Science University of Bristol  Bristol UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science University of Bristol  Bristol UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113458314","display_name":"Dhiraj K. Pradhan","orcid":null},"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":"Dhiraj K. Pradhan","raw_affiliation_strings":["Department of Computer Science, University of Bristol, Bristol, UK","Department of Computer Science University of Bristol  Bristol UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science University of Bristol  Bristol UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110802100","display_name":"Ta\u015fk\u0131n Ko\u00e7ak","orcid":null},"institutions":[{"id":"https://openalex.org/I128277893","display_name":"Bah\u00e7e\u015fehir University","ror":"https://ror.org/00yze4d93","country_code":"TR","type":"education","lineage":["https://openalex.org/I128277893"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Taskin Kocak","raw_affiliation_strings":["Department of Computer Engineering, Bahcesehir University, Istanbul, Turkey","Department of Computer Engineering Bahcesehir University Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Bahcesehir University, Istanbul, Turkey","institution_ids":["https://openalex.org/I128277893"]},{"raw_affiliation_string":"Department of Computer Engineering Bahcesehir University Istanbul, Turkey","institution_ids":["https://openalex.org/I128277893"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.851,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.8590875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"19","issue":"3","first_page":"420","last_page":"428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9998999834060669,"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.9998999834060669,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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/hamming-code","display_name":"Hamming code","score":0.7105392813682556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.592425525188446},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5895903706550598},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4266012907028198},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.4231458306312561},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.41310185194015503},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3762266933917999},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.36522209644317627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35036733746528625},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.28238576650619507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25051793456077576}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7105392813682556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.592425525188446},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5895903706550598},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4266012907028198},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.4231458306312561},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.41310185194015503},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3762266933917999},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.36522209644317627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35036733746528625},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28238576650619507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25051793456077576},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tvlsi.2009.2036362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2009.2036362","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/65e099f6-ddda-452f-933a-ed9a79a215eb","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/65e099f6-ddda-452f-933a-ed9a79a215eb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Argyrides, C, Pradhan, D K & Kocak, T 2011, 'Matrix codes for reliable and cost efficient memory chips', IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 19, no. 3, pp. 1 - 9. https://doi.org/10.1109/TVLSI.2009.2036362","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1489870749","https://openalex.org/W1597839486","https://openalex.org/W1851753245","https://openalex.org/W1922918362","https://openalex.org/W1980817751","https://openalex.org/W1987285959","https://openalex.org/W2001291855","https://openalex.org/W2021708499","https://openalex.org/W2021792911","https://openalex.org/W2029692888","https://openalex.org/W2033757213","https://openalex.org/W2050067499","https://openalex.org/W2054917929","https://openalex.org/W2083675073","https://openalex.org/W2090813909","https://openalex.org/W2110196049","https://openalex.org/W2113259075","https://openalex.org/W2114720942","https://openalex.org/W2118637853","https://openalex.org/W2123596317","https://openalex.org/W2127644226","https://openalex.org/W2127894564","https://openalex.org/W2132286986","https://openalex.org/W2138284418","https://openalex.org/W2142358791","https://openalex.org/W2144283129","https://openalex.org/W2147074111","https://openalex.org/W2149985396","https://openalex.org/W2150182783","https://openalex.org/W2153448314","https://openalex.org/W2159103279","https://openalex.org/W2169087039","https://openalex.org/W2169213530","https://openalex.org/W4211147273","https://openalex.org/W4230392938","https://openalex.org/W6638981165"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W1987803429","https://openalex.org/W2158117886","https://openalex.org/W2963549154","https://openalex.org/W2740543340","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W2182731056","https://openalex.org/W3105418885"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,21],"method":[4,51],"to":[5,13,29,62,132],"protect":[6],"memories":[7],"against":[8],"multiple":[9,48],"bit":[10],"upsets":[11],"and":[12,26,35,47,68,80,98],"improve":[14],"manufacturing":[15],"yield.":[16],"The":[17,50,58,71],"proposed":[18,72,120],"method,":[19,121],"called":[20],"Matrix":[22],"code,":[23],"combines":[24],"Hamming":[25,69,78],"Parity":[27],"codes":[28,79,86],"assure":[30],"the":[31,38,42,77,114,119,124,136],"improvement":[32],"of":[33,37,44],"reliability":[34,104],"yield":[36,115,125],"memory":[39],"chips":[40],"in":[41,96,110],"presence":[43],"high":[45],"defects":[46],"bit-upsets.":[49],"is":[52,130],"evaluated":[53],"using":[54],"fault":[55],"injection":[56],"experiments.":[57],"results":[59],"are":[60],"compared":[61],"well-known":[63],"techniques":[64],"such":[65,92],"as":[66,93],"Reed-Muller":[67,85,140],"codes.":[70,141],"technique":[73],"performs":[74],"better":[75,134],"than":[76,108,135],"achieves":[81,103],"comparable":[82],"performance":[83],"with":[84,87],"very":[88],"favorable":[89],"implementation":[90],"gains":[91],"25%":[94],"reduction":[95],"area":[97],"power":[99],"consumption.":[100],"It":[101],"also":[102],"increase":[105],"by":[106,118,123,139],"more":[107],"50%":[109],"some":[111],"cases.":[112],"Further,":[113],"benefits":[116],"provided":[117,138],"measured":[122],"improvements":[126],"per":[127],"cost":[128],"metric,":[129],"up":[131],"300%":[133],"ones":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}