{"id":"https://openalex.org/W2086039448","doi":"https://doi.org/10.1109/isit.2012.6283487","title":"Making WOM codes decodable using short synchronous WOM codes","display_name":"Making WOM codes decodable using short synchronous WOM codes","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2086039448","doi":"https://doi.org/10.1109/isit.2012.6283487","mag":"2086039448"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6283487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"preprint","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/A5066281088","display_name":"Nicolas Bitouz\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148559","display_name":"\u00c9cole nationale sup\u00e9rieure de techniques avanc\u00e9es Bretagne","ror":"https://ror.org/059n54003","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102","https://openalex.org/I4210148559"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Bitouze","raw_affiliation_strings":["Department of Electronics, Telecom Bretagne, Brest, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics, Telecom Bretagne, Brest, France","institution_ids":["https://openalex.org/I4210148559"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014522913","display_name":"Alexandre Graell i Amat","orcid":"https://orcid.org/0000-0002-5725-869X"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Alexandre Graell i Amat","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","Department of Signals and Systems, Chalmers University of Technology, SE 412\u201096, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, SE 412\u201096, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"DEPARTMENT OF INFORMATICS, UNIVERSITY OF BERGEN, N-5020 BERGEN, NORWAY","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3726,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66263045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1381","last_page":"1385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9861999750137329,"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/T11478","display_name":"Caching and Content Delivery","score":0.9861999750137329,"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.984499990940094,"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/T13999","display_name":"Digital Rights Management and Security","score":0.9700000286102295,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7130005359649658},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.5731817483901978},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4589584469795227},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4515487551689148},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.4444204270839691},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4211781620979309},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3594633936882019},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3590250015258789},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2870430052280426},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.16636276245117188}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7130005359649658},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.5731817483901978},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4589584469795227},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4515487551689148},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.4444204270839691},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4211781620979309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3594633936882019},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3590250015258789},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2870430052280426},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.16636276245117188}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2012.6283487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:165739","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/165739","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1970221790","https://openalex.org/W2033700095","https://openalex.org/W2064453398","https://openalex.org/W2148520639","https://openalex.org/W6681893229"],"related_works":["https://openalex.org/W2023731335","https://openalex.org/W2976106059","https://openalex.org/W2295671989","https://openalex.org/W2005241596","https://openalex.org/W2060232182","https://openalex.org/W2363930252","https://openalex.org/W2787656098","https://openalex.org/W2369782648","https://openalex.org/W2289440727","https://openalex.org/W1678468747"],"abstract_inverted_index":{"While":[0],"some":[1],"write":[2],"once":[3],"memory":[4],"(WOM)":[5],"codes":[6,127,192,204,209,225],"are":[7,210],"inherently":[8],"decodable,":[9],"others":[10],"require":[11],"the":[12,16,24,27,35,66,71,76,88,99,149,177,183],"added":[13],"knowledge":[14],"of":[15,26,55,83,112,165,185,189,216,222,235],"current":[17,67,150],"generation":[18,68],"in":[19,53,110],"order":[20],"to":[21,64,81,123,141,231],"successfully":[22],"decode":[23],"state":[25],"memory.":[28],"If":[29],"there":[30],"is":[31,97,135,140,197,229],"no":[32],"limit":[33],"on":[34,90,182],"code":[36,44,56,72,113,164],"length,":[37],"n,":[38],"a":[39,107,120,130,158,186,220],"binary":[40],"non-decodable":[41,91,125],"t-write":[42],"WOM":[43,92,126,163,191,224],"can":[45],"be":[46,82],"made":[47],"decodable":[48,128],"at":[49,129],"an":[50],"insignificant":[51],"cost":[52],"terms":[54,111],"rate":[57,184],"by":[58,156,213],"adding":[59],"t":[60,77,100,167,196],"\u2212":[61,78,101,161,168],"1":[62,79,102,169],"cells":[63,80,104,143],"store":[65,148],"after":[69],"replicating":[70],"enough":[73],"times":[74],"for":[75],"negligible":[84],"weight.":[85],"This":[86],"justifies":[87],"research":[89],"codes.":[93,218],"However,":[94],"if":[95],"n":[96,134,194],"bounded,":[98],"additional":[103,154],"may":[105],"introduce":[106],"significant":[108],"loss":[109],"rate.":[114],"In":[115],"this":[116,206],"paper,":[117],"we":[118],"propose":[119],"new":[121],"method":[122],"make":[124],"lower":[131],"price":[132],"when":[133],"bounded.":[136],"The":[137],"main":[138],"idea":[139],"add":[142],"that":[144],"do":[145],"not":[146,175],"only":[147],"generation,":[151],"but":[152],"also":[153],"data,":[155],"using":[157],"synchronous":[159,190,223],"(t":[160],"1)-write":[162],"length":[166],"or":[170],"slightly":[171],"above":[172],"which":[173],"does":[174],"contain":[176],"all-zero":[178],"codeword.":[179],"A":[180],"bound":[181],"simple":[187],"family":[188],"with":[193,226],"=":[195],"given,":[198],"as":[199,201],"well":[200],"very":[202],"short":[203],"from":[205],"family.":[207],"Better":[208],"then":[211],"obtained":[212],"local":[214],"manipulations":[215],"these":[217],"Finally,":[219],"construction":[221],"good":[227],"properties":[228],"proposed":[230],"reach":[232],"higher":[233],"values":[234],"t.":[236]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
