A Coding Algorithm for Constant Weight Vectors: A Geometric Approach Based on Dissections

Tian, Chao; Vaishampayan, Vinay A.; Sloane, N. J. A.

doi:10.1109/tit.2008.2011441

“…The enumeration scheme (h ≤δ , h −1 ≤δ ) can be implemented with computational complexity polynomial in n by methods such as [4, pp. 27-30], [23], [27].…”

Section: A Constant-weight Weak Wom Schemes From Concentrated-weightmentioning

confidence: 99%

Rank-Modulation Rewrite Coding for Flash Memories

Gad

¹

,

Yaakobi

²

,

Jiang

³

et al. 2015

IEEE Trans. Inform. Theory

3

0

View full text Add to dashboard Cite

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require a large number of lifetime writes.The proposed approach in this paper for alleviating this problem consists of the efficient integration of two key ideas: (i) improving reliability and endurance by representing the information using relative values via the rank modulation scheme and (ii) increasing the overall (lifetime) capacity of the flash device via rewriting codes, namely, performing multiple writes per cell before erasure.This paper presents a new coding scheme that combines rank-modulation with rewriting. The key benefits of the new scheme include: (i) the ability to store close to 2 bits per cell on each write with minimal impact on the lifetime of the memory, and (ii) efficient encoding and decoding algorithms that make use of capacity-achieving write-once-memory (WOM) codes that were proposed recently.

show abstract

“…The enumeration scheme (h ≤δ , h −1 ≤δ ) can be implemented with computational complexity polynomial in n by methods such as [4, pp. 27-30], [25], [30].…”

Section: A Constant-weight Weak Wom Schemes From Concentrated-weightmentioning

confidence: 99%

Rank-modulation rewriting codes for flash memories

Gad

¹

,

Yaakobi

²

,

Jiang

³

et al. 2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require a large number of lifetime writes.The proposed approach in this paper for alleviating this problem consists of the efficient integration of two key ideas: (i) improving reliability and endurance by representing the information using relative values via the rank modulation scheme and (ii) increasing the overall (lifetime) capacity of the flash device via rewriting codes, namely, performing multiple writes per cell before erasure.This paper presents a new coding scheme that combines rank-modulation with rewriting. The key benefits of the new scheme include: (i) the ability to store close to 2 bits per cell on each write with minimal impact on the lifetime of the memory, and (ii) efficient encoding and decoding algorithms that make use of capacity-achieving write-once-memory (WOM) codes that were proposed recently.

show abstract

“…For a general value of q, constant weight codes are useful in a variety of applications such as fault-tolerant circuit design and computing, pattern generation for circuit testing, identification coding, and optical overlay networks [1], [2]. However, a simple encoding algorithm for a given imbalance q = 0 has not been known.…”

Section: Introductionmentioning

confidence: 99%

“…However, a simple encoding algorithm for a given imbalance q = 0 has not been known. The publications dealing with constructions of unbalanced codes that the authors are aware of are the geometric approach by Tian et al [1] and the enumerative method by Schalkwijk [4] (see also [2]). Below, we briefly discuss these two methods.…”

Section: Introductionmentioning

confidence: 99%