{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T21:23:32Z","timestamp":1793481812570,"version":"4.5.0"},"publisher-location":"Dordrecht","reference-count":27,"publisher":"Springer Netherlands","isbn-type":[{"value":"9789401775106","type":"print"},{"value":"9789401775120","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-94-017-7512-0_10","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T16:17:40Z","timestamp":1464279460000},"page":"281-320","source":"Crossref","is-referenced-by-count":8,"title":["BCH and LDPC Error Correction Codes for NAND Flash Memories"],"prefix":"10.1007","author":[{"given":"Alessia","family":"Marelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rino","family":"Micheloni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"issue":"379\u2013423","key":"10_CR1","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27(379\u2013423), 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes, in Proceedings of ICC\u201993, Geneve, Switzerland, May 1993, pp. 1064\u20131070","DOI":"10.1109\/ICC.1993.397441"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"R. Micheloni, A. Marelli, K. Eshghi, Inside Solid State Drives (SSD) (Springer, Berlin, 2012)","DOI":"10.1007\/978-94-007-5146-0"},{"key":"10_CR4","unstructured":"R. Micheloni, A. Marelli, R. Ravasio, Error Correction Codes for Non-Volatile Memories (Springer, Berlin, 2008)"},{"key":"10_CR5","unstructured":"S. Lin, D.J. Costello, Error Control Coding (Prentice Hall, Upper Saddle River, 2004)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"T.K. Moon, Error Correcting Coding\u2014Mathematical Methods and Algorithm (Wiley, NJ, 2005)","DOI":"10.1002\/0471739219"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"R.C. Bose, D.K. Ray-Chaudhuri, On a class of error correcting binary group codes. Inf. Control 3, 68-79 (1960)","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"10_CR8","unstructured":"A. Hocquengheim, Codes Correcteurs d\u2019erreurs. Chiffres 2, Sept 1959"},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0004972715000763","volume":"93","author":"MA Pellegrini","year":"2016","unstructured":"M.A. Pellegrini, The (2, 3)-generation of the classical simple groups of dimensions 6 and 7. Bull. Aust. Math. Soc. 93(1), 61\u201372 (2016)","journal-title":"Bull. Aust. Math. Soc."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"M.A. Pellegrini, M.C. T. Bellani, The simple classical groups of dimension less than 6 which are (2, 3)-generated. J. Algebra Appl. 14(10), 1550148 (2015) (15p)","DOI":"10.1142\/S0219498815501480"},{"key":"10_CR11","unstructured":"M. Kim et al. Decoder error probability of binary linear block codes and its application to binary primitive BCH codes. IEICE Trans. Fundam. (1996)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"R. Micheloni, L. Crippa, A. Marelli, Inside NAND Flash Memories (Springer, Berlin, 2010)","DOI":"10.1007\/978-90-481-9431-5"},{"key":"10_CR13","unstructured":"E.R. Berlekamp, Algebraic Coding Theory (McGraw Hill, New York, 1968)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"H.O. Burton, Inversionless decoding of binary BCH codes. IEEE Trans. Inf. Theory 17 (1971)","DOI":"10.1109\/TIT.1971.1054655"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Y. Lee, H. Yoo, I. Yoo, I.C. Park, 6.4\u00a0Gb\/s multi-threaded BCH encoder and decoder for multichannel SSD controllers, in ISCC Digest of Technical Papers (2012)","DOI":"10.1109\/ISSCC.2012.6177075"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"R.G. Gallager, Low-density parity-check codes. IRE Trans. Inf. Theory IT-8, 21\u201328 (1962)","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10_CR17","first-page":"23","volume":"11","author":"V Zyablov","year":"1975","unstructured":"V. Zyablov, M. Pinsker, Estimation of the error-correction complexity of Gallager low-density codes. Problemy Peredachi Informatsii 11, 23\u201326 (1975)","journal-title":"Problemy Peredachi Informatsii"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"R.M. Tanner, A recursive approach to low complexity codes. IEEE Trans. Inf. Theory IT-27(5), 533\u2013547 (1981)","DOI":"10.1109\/TIT.1981.1056404"},{"issue":"1","key":"10_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"GA Margulis","year":"1982","unstructured":"G.A. Margulis, Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2(1), 71\u201378 (1982)","journal-title":"Combinatorica"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Z. Li et al., Efficient encoding of quasi-cyclic low-density parity check codes. IEEE Trans. Commun. (2006)","DOI":"10.1109\/TCOMM.2005.858628"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"S. Myung et al., Quasi-cyclic LDPC codes for fast encoding. IEEE Inf. Theory June (2005)","DOI":"10.1109\/TIT.2005.851753"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Z. Li, L. Chen, S. Lin, W. Fong, P.-S. Yeh, Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun. 54, 71\u201381 (2006)","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"10_CR23","unstructured":"T. Richardson, Error floors of LDPC codes, in Proceedings of the 41st Annual Allerton Conference on Communication, USA (2003)"},{"key":"10_CR24","unstructured":"R. Micheloni et al., Hardware\/software co-simulation for error-floor detection in LDPC, in Proceedings of Flash Memory Summit, www.flashmemorysummit.com , Santa Clara, CA, USA, 5\u20137 Aug 2014"},{"key":"10_CR25","unstructured":"M. Fossorier et al., Channel Coding: Theory, Algorithms and Application (Wiley, NJ, 2005)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"S. Landner, O. Milenkovic, Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes, in International Conference on Wireless Networks (2005)","DOI":"10.1109\/WIRLES.2005.1549481"},{"key":"10_CR27","unstructured":"L. Dolecek et al., Predicting error floors of structured LDPC codes: deterministic bounds and estimates. IEEE J. Sel. Areas Commun. (2009)"}],"container-title":["3D Flash Memories"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-017-7512-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T22:49:31Z","timestamp":1567982971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-94-017-7512-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789401775106","9789401775120"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-94-017-7512-0_10","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}