{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:56Z","timestamp":1740122516233,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T00:00:00Z","timestamp":1692835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WA3907\/1-1"],"award-info":[{"award-number":["WA3907\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","award":["57381412"],"award-info":[{"award-number":["57381412"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union\u2019s Horizon 2020 research and innovation program through the Marie Sklodowska-Curie","award":["713683"],"award-info":[{"award-number":["713683"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper considers coding for so-called <jats:italic>partially stuck (defect)<\/jats:italic> memory cells. Such memory cells can only store partial information as some of their levels cannot be used fully due to, e.g., wearout. First, we present new constructions that are able to mask <jats:italic>u<\/jats:italic> partially stuck cells while correcting at the same time <jats:italic>t<\/jats:italic> random errors. The process of \u201cmasking\u201d determines a word whose entries coincide with writable levels at the (partially) stuck cells. For <jats:inline-formula><jats:alternatives><jats:tex-math>$$u&gt;1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>u<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and alphabet size <jats:inline-formula><jats:alternatives><jats:tex-math>$$q&gt;2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>q<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, our new constructions improve upon the required redundancy of known constructions for <jats:inline-formula><jats:alternatives><jats:tex-math>$$t=0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>t<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and require less redundancy for masking partially stuck cells than former works required for masking fully stuck cells (which cannot store any information). Second, we show that treating some of the partially stuck cells as erroneous cells can decrease the required redundancy for some parameters. Lastly, we derive Singleton-like, sphere-packing-like, and Gilbert\u2013Varshamov-like bounds. Numerical comparisons state that our constructions match the Gilbert\u2013Varshamov-like bounds for several code parameters, e.g., BCH codes that contain all-one word by our first construction.<\/jats:p>","DOI":"10.1007\/s10623-023-01270-0","type":"journal-article","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T14:06:33Z","timestamp":1692885993000},"page":"4019-4058","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coding and bounds for partially defective memory cells"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2429-1565","authenticated-orcid":false,"given":"Haider","family":"Al Kim","sequence":"first","affiliation":[]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[]},{"given":"Ludo","family":"Tolhuizen","sequence":"additional","affiliation":[]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"issue":"1","key":"1270_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/120880100","volume":"27","author":"S Ball","year":"2013","unstructured":"Ball S., Blokhuis A.: A bound for the maximum weight of a linear code. SIAM J. Discrete Math. 27(1), 575\u2013583 (2013).","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1270_CR2","first-page":"62","volume":"13","author":"I Belov","year":"1977","unstructured":"Belov I., Shashin A.M.: Codes that correct triple defects in memory. Problems Inf. Transmiss. 13(4), 62\u201365 (1977) (in Russian).","journal-title":"Problems Inf. Transmiss."},{"issue":"5","key":"1270_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TIT.1987.1057347","volume":"33","author":"J Borden","year":"1987","unstructured":"Borden J., Vinck A.J.: On coding for \u2018stuck-at\u2019 defects (Corresp.). IEEE Trans. Inf. Theory 33(5), 729\u2013735 (1987).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1270_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TIT.1985.1056992","volume":"31","author":"CL Chen","year":"1985","unstructured":"Chen C.L.: Linear codes for masking memory defects (Corresp.). IEEE Trans. Inf. Theory 31(1), 105\u2013106 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1270_CR5","unstructured":"Dumer, I.I.: On linear defect-correcting codes. In: Proc. 1987 Int. Workshop on Convolutional Codes and Multiuser Communication, Sochi, pp. 222-225 (1987)"},{"issue":"4","key":"1270_CR6","first-page":"3","volume":"25","author":"II Dumer","year":"1989","unstructured":"Dumer I.I.: Asymptotically optimal codes correcting memory defects of fixed multiplicity. Problemy Peredachi Informatsii 25(4), 3\u201310 (1989).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"1270_CR7","first-page":"3","volume":"26","author":"II Dumer","year":"1990","unstructured":"Dumer I.I.: Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity. Problemy Peredachi Informatsii 26(2), 3\u201317 (1990).","journal-title":"Problemy Peredachi Informatsii"},{"key":"1270_CR8","doi-asserted-by":"crossref","unstructured":"Gleixner B., Pellizzer F., Bez R.: \u201cReliability Characterization of Phase Change Memory,\u201d In: 10th Annual NVMTS. IEEE 2009, 7\u201311 (2009).","DOI":"10.1109\/NVMT.2009.5429783"},{"issue":"5","key":"1270_CR9","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer J.H.: A bound for error-correcting codes. IBM J Res Dev 4(5), 532\u2013542 (1960).","journal-title":"IBM J Res Dev"},{"key":"1270_CR10","unstructured":"Guruswami, V., Rurda, A., Sudan, M.: \u201cEssential Coding Theory\u201d, March 15, (2019). Available at https:\/\/cse.buffalo.edu\/faculty\/atri\/courses\/coding-theory\/book\/web-coding-book.pdf"},{"key":"1270_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0019-9958(72)90887-X","volume":"20","author":"CRP Hartmann","year":"1972","unstructured":"Hartmann C.R.P., Tzeng K.K.: Generalizations of the BCH-bound. Inf. Control 20, 489\u2013498 (1972).","journal-title":"Inf. Control"},{"issue":"6","key":"1270_CR12","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1109\/TIT.1983.1056763","volume":"29","author":"C Heegard","year":"1983","unstructured":"Heegard C.: Partitioned linear block codes for computer memory with \u2018Stuck-at\u2019 defects. IEEE Trans. Inf. Theory 29(6), 831\u2013842 (1983).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1270_CR13","unstructured":"Kim K., Ahn S.J.: Reliability Investigations for Manufacturable High Density PRAM. In: IEEE International Reliability Physics Symposium, 2005. Proceedings. 43rd Annual. IEEE 2005, 157\u2013162 (2005)."},{"issue":"1","key":"1270_CR14","first-page":"28","volume":"21","author":"A Kuznetsov","year":"1985","unstructured":"Kuznetsov A.: Coding in a channel with generalized defects and random errors. Problems Inf. Transmiss. 21(1), 28\u201334 (1985) (in Russian).","journal-title":"Problems Inf. Transmiss."},{"issue":"2","key":"1270_CR15","first-page":"52","volume":"10","author":"A Kuznetsov","year":"1974","unstructured":"Kuznetsov A., Tsybakov B.: for memories with defective cells. Probl. Inf. Transmiss. 10(2), 52\u201360 (1974) (in Russian).","journal-title":"Probl. Inf. Transmiss."},{"issue":"6","key":"1270_CR16","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TIT.1978.1055963","volume":"24","author":"AV Kuznetsov","year":"1978","unstructured":"Kuznetsov A.V., Kasami T., Yamamura S.: An error correcting scheme for defective memory. IEEE Trans. Inf. Theory 24(6), 712\u2013718 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1270_CR17","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/LED.2009.2015222","volume":"30","author":"S Lee","year":"2009","unstructured":"Lee S., Jeong J.-H., Lee T.S., Kim W.M., Cheong B.-K.: A study on the failure mechanism of a phase-change memory in write\/erase cycling. IEEE Electron Device Lett. 30(5), 448\u2013450 (2009).","journal-title":"IEEE Electron Device Lett."},{"issue":"6","key":"1270_CR18","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/18.641543","volume":"43","author":"HA Loeliger","year":"1997","unstructured":"Loeliger H.A.: Averaging Arguments for Lattices and Linear Codes. IEEE Trans. Inf. Theory 43(6), 1767\u20131772 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1270_CR19","first-page":"98","volume":"14","author":"VV Losev","year":"1978","unstructured":"Losev V.V., Konopel\u2019ko V.K., Daryakin Y.D.: Double-and-triple-defect-correcting codes. Problems Inf. Transmiss. 14(4), 98\u2013101 (1978) (in Russian).","journal-title":"Problems Inf. Transmiss."},{"issue":"3","key":"1270_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TDMR.2004.836724","volume":"4","author":"A Pirovano","year":"2004","unstructured":"Pirovano A., Redaelli A., Pellizzer F., Ottogalli F., Tosi M., Ielmini D., Lacaita A.L., Bez R.: Reliability study of phase-change nonvolatile memories. IEEE Trans. Device Matter Reliab. 4(3), 422\u2013427 (2004).","journal-title":"IEEE Trans. Device Matter Reliab."},{"issue":"6","key":"1270_CR21","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TIT.1979.1056108","volume":"IT\u201325","author":"C Roos","year":"1979","unstructured":"Roos C.: On the structure of convolutional and cyclic convolutional codes. IEEE Trans. Inf. Theory IT\u201325(6), 676\u2013683 (1979).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1270_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"RM Roth","year":"2006","unstructured":"Roth R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)."},{"key":"1270_CR23","doi-asserted-by":"publisher","unstructured":"Sidorenko, V., Schmidt, G., Gabidulin, E., Bossert, M., Afanassiev, V.: On polyalphabetic block codes. In: IEEE Information Theory Workshop, 2005., Rotorua, New Zealand, pp. 4 pp.-, (2005) https:\/\/doi.org\/10.1109\/ITW.2005.1531889.","DOI":"10.1109\/ITW.2005.1531889"},{"key":"1270_CR24","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0019-9958(74)91071-7","volume":"25","author":"G Solomon","year":"1974","unstructured":"Solomon G.: A note on alphabet codes and fields of computation. Inform. Control 25, 395\u2013398 (1974).","journal-title":"Inform. Control"},{"key":"1270_CR25","unstructured":"Tsybakov, B.S., Gelfand, S.I., Kuznetsov, A.V., Ortyukov, S.I.: Reliable computation and reliable storage of information. In: Proc. IEEE-USSR Workshop (1975)"},{"issue":"1","key":"1270_CR26","first-page":"111","volume":"11","author":"BS Tsybakov","year":"1975","unstructured":"Tsybakov B.S.: \u201cGroup additive defect-correcting codes,\u2019\u2019 (in Russian). Problems Inf. Transmiss. 11(1), 111\u2013113 (1975).","journal-title":"Problems Inf. Transmiss."},{"issue":"1","key":"1270_CR27","first-page":"21","volume":"11","author":"BS Tsybakov","year":"1975","unstructured":"Tsybakov B.S.: Defects and error correction. Problems Inf. Transmiss. 11(1), 21\u201330 (1975) (in Russian).","journal-title":"Problems Inf. Transmiss."},{"key":"1270_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00174-5","volume-title":"Introduction the Coding Theory","author":"JH van Lint","year":"1992","unstructured":"van Lint J.H.: Introduction the Coding Theory, 2nd edn Springer, Berlin (1992) https:\/\/doi.org\/10.1007\/978-3-662-00174-5.","edition":"2"},{"issue":"2","key":"1270_CR29","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/TIT.2015.2512581","volume":"62","author":"A Wachter-Zeh","year":"2016","unstructured":"Wachter-Zeh A., Yaakobi E.: Codes for partially stuck-at memory cells. IEEE Trans. Inf. Theory 62(2), 639\u2013654 (2016).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01270-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01270-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01270-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T12:05:41Z","timestamp":1699099541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01270-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,24]]},"references-count":29,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01270-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,8,24]]},"assertion":[{"value":"2 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}