Index-Less Flash Codes with Reduced Block Size with Little Overhead

摘要

An improvement of the index-less indexed flash codes (ILIFC) is investigated. A flash code is a coding scheme for flash memories which have two remarkable aspects; the asymmetricity of operations over flash memory cells and the characteristic degradation caused by block erasure. ILIFC tries to obtain good performance by dividing the set of cells to small blocks, but some problems arise because the size of block cannot be changed. It is shown in this study that the block size of ILIFC can be reduced by half. The modification improves the performance and gives more flexibility on the code design.