Maximization of average number of rewriting of ILIFC with inversion operation

The Index-less Indexed Flash Code (ILIFC) is a coding scheme for flash memories, in which one bit of a data sequence is stored in a slice consisting of several cells but the index of the bit is stored implicitly. Although the code rate of the scheme is not good, the scheme uses the cell state space very efficiently. Many modified ILIFC schemes have been proposed. One of them is an ILIFC with inversion operation. The scheme reduces an increase of the sum of changes of cell levels at each rewriting request. In this paper we analyze the scheme and show that the analytic results coincide with simulation results for many cases.