Codes for Asymmetric Limited-Magnitude Errors with Application to Multi-Level 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
This work was supported in part by the Caltech Lee Center for Advanced Networking. Also available http://www.paradise.caltech.edu/papers/etr088.pdfFiles
Name | Size | Download all |
---|---|---|
md5:27716ea494d7a3c886ee470570ac170f
|
279.9 kB | Preview Download |
md5:2a5740ed2d2eb326625d6f04ac1af18b
|
234.0 kB | Preview Download |
Additional details
- Eprint ID
- 26119
- Resolver ID
- CaltechPARADISE:2008.ETR088
- Created
-
2008-09-08Created from EPrint's datestamp field
- Updated
-
2021-08-18Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group