{"id":"https://openalex.org/W2140420067","doi":"https://doi.org/10.1109/isit.2007.4557599","title":"Reliable Memories with Subline Accesses","display_name":"Reliable Memories with Subline Accesses","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2140420067","doi":"https://doi.org/10.1109/isit.2007.4557599","mag":"2140420067"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557599","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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/A5081639502","display_name":"Junsheng Han","orcid":"https://orcid.org/0009-0006-7162-017X"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Junsheng Han","raw_affiliation_strings":["University of California, San Diego La Jolla, CA, USA","University of California; San Diego La Jolla CA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California; San Diego La Jolla CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010023772","display_name":"L. A. Lastras-Monta\u00f1o","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luis Alfonso Lastras-Montano","raw_affiliation_strings":["IBM T. J. Watson Research Center Yorktown Heights, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081639502"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.17849409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2531","last_page":"2535"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998000264167786,"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/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.8258258104324341},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7979211807250977},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.6438066363334656},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4551406502723694},{"id":"https://openalex.org/keywords/source-lines-of-code","display_name":"Source lines of code","score":0.44448918104171753},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.38692089915275574},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3850347697734833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38315027952194214},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.35509300231933594},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3270546793937683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29066187143325806},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2620440125465393},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.13056597113609314},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09288635849952698}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8258258104324341},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7979211807250977},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.6438066363334656},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4551406502723694},{"id":"https://openalex.org/C199519371","wikidata":"https://www.wikidata.org/wiki/Q942695","display_name":"Source lines of code","level":3,"score":0.44448918104171753},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.38692089915275574},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3850347697734833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38315027952194214},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.35509300231933594},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3270546793937683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29066187143325806},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2620440125465393},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.13056597113609314},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09288635849952698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2007.4557599","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vivaldi.ucsd.edu:8080/starpapers/han_isit07a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2012785774","https://openalex.org/W2061680022","https://openalex.org/W2125940459","https://openalex.org/W2146867270","https://openalex.org/W2466200538","https://openalex.org/W4239704585"],"related_works":["https://openalex.org/W1888970550","https://openalex.org/W3085024073","https://openalex.org/W1495042958","https://openalex.org/W2494338568","https://openalex.org/W2477601761","https://openalex.org/W2155168628","https://openalex.org/W2981191153","https://openalex.org/W2394408226","https://openalex.org/W4389168214","https://openalex.org/W4210772589"],"abstract_inverted_index":{"We":[0,160,207,235],"study":[1,140],"memories":[2,30],"protected":[3],"with":[4,100,153,175],"error":[5,146,182,191],"control":[6,147],"codes,":[7,180],"in":[8,15,23,64,109,124,166,173,186,203,256],"which":[9,17,167,241],"the":[10,31,44,60,118,125,142,194,204,251,257],"memory's":[11],"contents":[12],"are":[13,18,201],"organized":[14],"lines":[16,41],"read":[19,54],"and":[20,55,158,162,190,219],"written":[21],"to":[22,38,53,69,111,128,149,244],"isolation":[24],"from":[25],"other":[26],"lines.":[27],"In":[28,134],"these":[29],"available":[32],"redundancy":[33,122,212],"is":[34,105,171,184,197],"structured":[35],"so":[36],"as":[37,47,63],"protect":[39],"individual":[40],"rather":[42],"than":[43],"entire":[45],"memory":[46,61,126],"a":[48,113,139,164,168,187,214,221,229],"whole.":[49],"Often":[50],"designers":[51,89],"wish":[52],"write":[56],"only":[57],"parts":[58],"of":[59,116,121,141,144,178,217,233,250],"line,":[62],"some":[65],"instances":[66],"this":[67,135,226],"leads":[68],"various":[70],"favorable":[71],"system":[72],"design":[73],"tradeoffs,":[74],"including":[75],"better":[76],"power":[77],"consumption,":[78],"increased":[79,130],"data":[80],"access":[81],"concurrency,":[82],"etc.":[83],"(alternatively":[84],"one":[85],"may":[86],"say":[87],"that":[88,108,224],"sometimes":[90],"would":[91],"prefer":[92],"smaller":[93],"line":[94],"sizes).":[95],"Nevertheless":[96],"when":[97],"designing":[98],"systems":[99],"such":[101],"subline":[102,151],"accesses":[103,152],"it":[104],"often":[106],"found":[107],"order":[110],"mantain":[112],"given":[114,215],"level":[115,189,196,216],"reliability,":[117],"total":[119],"amount":[120],"allocated":[123],"needs":[127],"be":[129],"beyond":[131],"desirable":[132],"levels.":[133],"work,":[136],"we":[137],"initiate":[138],"problem":[143],"structuring":[145],"codes":[148,247],"allow":[150],"good":[154],"tradeoffs":[155],"between":[156],"reliability":[157,218],"redundancy.":[159],"motivate":[161],"explore":[163],"setting":[165],"\"double-lookup\"":[169],"protocol":[170],"used":[172,255],"conjunction":[174],"certain":[176,230],"types":[177],"two-level":[179],"whereby":[181],"detection":[183],"attained":[185],"first":[188,205],"correction":[192],"using":[193],"second":[195],"performed":[198],"whenever":[199],"errors":[200],"detected":[202],"level.":[206],"obtain":[208],"lower":[209],"bounds":[210],"on":[211],"for":[213,228],"offer":[220],"code":[222],"construction":[223,240],"attains":[225],"bound":[227],"important":[231],"class":[232],"parameters.":[234],"also":[236],"introduce":[237],"an":[238],"alternate":[239],"allows":[242],"us":[243],"find":[245],"longer":[246],"under":[248],"restrictions":[249],"Galois":[252],"field":[253],"size":[254],"codes.":[258]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}