2000 character limit reached
Coding for Memory with Stuck-at Defects (1304.4821v1)
Published 17 Apr 2013 in cs.IT and math.IT
Abstract: In this paper, we propose an encoding scheme for partitioned linear block codes (PLBC) which mask the stuck-at defects in memories. In addition, we derive an upper bound and the estimate of the probability that masking fails. Numerical results show that PLBC can efficiently mask the defects with the proposed encoding scheme. Also, we show that our upper bound is very tight by using numerical results.