Fault-tolerant neighborhood-disjoint address logic for solid state memory

摘要

A set of address elements is configured by assigning a set of constant weight code words satisfying inequality (2 w+t+1)<=n, where w is the weight of the code words, n is the number of address lines, and t is the maximum allowable number of defective address lines.