Paper Title |
Information Storage in the Stochastic Ising Model at Low Temperature |

Paper Identifier | TU1.R3.4 |
---|

Authors |
Ziv Goldfeld, Guy Bresler, Yury Polyanskiy, Massachusetts Institute of Technology, United States |

Session |
Emerging Applications of IT I |

Location |
Monge, Level 3 |

Session Time |
Tuesday, 09 July, 09:50 - 11:10 |

Presentation Time |
Tuesday, 09 July, **10:50 - 11:10** |

Manuscript |
Click here to download the manuscript |

Abstract
| Motivated by questions of data stabilization in emerging magnetic storage technologies, we study the retention of information in interacting particle systems. The interactions between particles adhere to the stochastic Ising model (SIM) on the two-dimensional (2D) $\sqrt{n}\times\sqrt{n}$ grid. The measure of interest is the information capacity $I_n(t)\triangleq\max_{p_{X_0}}I(X_0;X_t)$, where the initial spin configuration $X_0$ is a user-controlled input and the output configuration $X_t$ is produced by running $t$ steps of Glauber dynamics. After the results on the zero-temperature regime reported last year, this work focuses on the positive but low temperature regime. We first show that storing more than a single bit for an exponential time is impossible when the initial configuration is drawn from the equilibrium distribution. Specifically, if $X_0$ is drawn according to the Gibbs measure, then $I(X_0;X_t)\leq 1+o(1)$ for $t\geq\mathsf{exp}\left(cn^{\frac{1}{4}+\epsilon}\right)$. On the other hand, when scaling time with $\beta$, we propose a stripe-based coding scheme that stores order of $\sqrt{n}$ bits for $\mathsf{exp}(\beta)$ time. Key to the analysis of the scheme is a new result on the survival time of a single plus-labeled stripe in a sea of minuses. Together, the 1-bit upper bound and the stripe-based storage scheme constitute initial steps towards a general analysis of $I_n(t)$ for $\beta>0$. |