{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:50:57Z","timestamp":1784134257097,"version":"3.55.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0890-5401(89)90048-5","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"80-97","source":"Crossref","is-referenced-by-count":48,"title":["Coding for write-efficient memory"],"prefix":"10.1016","volume":"83","author":[{"given":"R.","family":"Ahlswede","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Z.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90048-5_BIB1_1","first-page":"76","article-title":"Coloring hypergraphs: A new approach to multi-user source coding","volume":"4","author":"Ahlswede","year":"1979","journal-title":"J. Combin. Inform. and System Sci."},{"key":"10.1016\/0890-5401(89)90048-5_BIB1_2","first-page":"220","article-title":"Coloring hypergraphs: A new approach to multi-user source coding","volume":"5","author":"Ahlswede","year":"1979","journal-title":"J. Combin. Inform. and System Sci."},{"issue":"No. 5","key":"10.1016\/0890-5401(89)90048-5_BIB2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TIT.1986.1057222","article-title":"Arbitrarily varying channels with state sequence known to the sender","volume":"IT-32","author":"Ahlswede","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(89)90048-5_BIB3","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TIT.1983.1056669","article-title":"On source coding with side information via a multiple-access channel and related problems in multi-user information theory","volume":"IT-29","author":"Ahlswede","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(89)90048-5_BIB4_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(77)90017-6","article-title":"Contributions to the geometry of Hamming spaces","volume":"17","author":"Ahlswede","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0890-5401(89)90048-5_BIB4_2","unstructured":"Borden, J. M. (in press), Coding for write-unidirectional memories, IEEE Trans. Inform. Theory."},{"key":"10.1016\/0890-5401(89)90048-5_BIB5","author":"Chung","year":"1967"},{"key":"10.1016\/0890-5401(89)90048-5_BIB20","doi-asserted-by":"crossref","unstructured":"Cohen, G. D., and Simonyi, G. (in press), Coding for write-uniderectional memories and conflict resolution, Discrete Applied Mathematics.","DOI":"10.1016\/0166-218X(92)90276-G"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90048-5_BIB6","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.1983.1056659","article-title":"Writing on dirty paper","volume":"IT-29","author":"Costa","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(89)90048-5_BIB7","series-title":"Storage rates for a restructurable memory","author":"El Gamal","year":"1983"},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90048-5_BIB8","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"Gelfand","year":"1980","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/0890-5401(89)90048-5_BIB9","series-title":"1983 Conf. on Inform. Sciences and Systems","article-title":"On the capacity of a permanent memory","author":"Heegard","year":"1983"},{"issue":"No. 5","key":"10.1016\/0890-5401(89)90048-5_BIB10","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TIT.1983.1056723","article-title":"On the capacity of computer memory with defects","volume":"IT-29","author":"Heegard","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90048-5_BIB11","first-page":"52","article-title":"Coding a memory with defective cells","volume":"10","author":"Kusnetsov","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0890-5401(89)90048-5_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)90344-8","article-title":"How to reuse a write-once memory","volume":"55","author":"Rivest","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(89)90048-5_BIB13","article-title":"On write-unidirectional memories","author":"Simonyi","year":"1986","journal-title":"Report Interne Enst 86 Doo 7"},{"key":"10.1016\/0890-5401(89)90048-5_BIB14","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/18.30992","article-title":"On write-unidirectional memory codes","author":"Simonyi","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90048-5_BIB15","first-page":"11","article-title":"Bounds for the codes correcting errors and defects","volume":"13","author":"Tsybakov","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0890-5401(89)90048-5_BIB16","series-title":"Combinatorics","article-title":"Recent results on perfect codes and related topics","author":"van Lint","year":"1975"},{"key":"10.1016\/0890-5401(89)90048-5_BIB17","series-title":"Proceedings, Seventh Symposium on Information Theory in the Benelux","first-page":"49","article-title":"Repeated recording for an optical disk","author":"Willems","year":"1986"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90048-5_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(83)80005-9","article-title":"On storage media with aftereffects","volume":"56","author":"Witsenhausen","year":"1983","journal-title":"Inform. and Control"},{"issue":"No. 6","key":"10.1016\/0890-5401(89)90048-5_BIB19","first-page":"1098","article-title":"Coding for write-once memory","volume":"63","author":"Wolf","year":"1984","journal-title":"AT & T Tech. J."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900485?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900485?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:26:35Z","timestamp":1549045595000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0890540189900485"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90048-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}