Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
Abstract
Several physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This paper studies block codes for asymmetric limited-magnitude errors over q-ary channels. We propose code constructions and bounds for such channels when the number of errors is bounded by t and the error magnitudes are bounded by ℓ. The constructions utilize known codes for symmetric errors, over small alphabets, to protect large-alphabet symbols from asymmetric limited-magnitude errors. The encoding and decoding of these codes are performed over the small alphabet whose size depends only on the maximum error magnitude and is independent of the alphabet size of the outer code. Moreover, the size of the codes is shown to exceed the sizes of known codes (for related error models), and asymptotic rate-optimality results are proved. Extensions of the construction are proposed to accommodate variations on the error model and to include systematic codes as a benefit to practical implementation.
Additional Information
© 2010 IEEE. Manuscript received August 26, 2008; revised November 12, 2009. Current version published March 17, 2010. Communicated by G. Seroussi, Associate Editor for Coding Theory. This work was supported in part by the Caltech Lee Center for Advanced Networking and by the GIF under Grant 2179- 1785.10/2007. The material in paper was presented in part at the IEEE International Symposium on Information Theory, Nice, France, June 2007. The authors wish to thank Anxiao Jiang for insightful comments and suggestions. In addition, the authors acknowledge the anonymous reviewers' contributions to the paper's quality of presentation.Attached Files
Published - Cassuto2010p7461Ieee_T_Inform_Theory.pdf
Files
Name | Size | Download all |
---|---|---|
md5:a33a666c6395a4cb570533da543f06aa
|
538.9 kB | Preview Download |
Additional details
- Eprint ID
- 17989
- Resolver ID
- CaltechAUTHORS:20100415-101346040
- GIF
- 2179-1785.10/2007
- Caltech Lee Center for Advanced Networking
- Created
-
2010-04-30Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field