Information Storage in the Stochastic Ising Model
Name
1805.03027.pdf
Description
Submitted version
Size
1.01 MB
Format
Adobe PDF
Checksum (MD5)
82d0f67b1fea2d65d70c87c21e95e514
Author(s)
Goldfeld, Ziv
Bresler, Guy
Polyanskiy, Yury
Date Issued
2021
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Goldfeld, Ziv, Bresler, Guy and Polyanskiy, Yury. 2021. "Information Storage in the Stochastic Ising Model." IEEE Transactions on Information Theory, 67 (3).
Version
Original manuscript
Abstract
© 1963-2012 IEEE. Most information storage devices write data by modifying the local state of matter, in the hope that sub-atomic local interactions stabilize the state for sufficiently long time, thereby allowing later recovery. Motivated to explore how temporal evolution of physical states in magnetic storage media affects their capacity, this work initiates the study of information retention in locally-interacting particle systems. The system dynamics follow the stochastic Ising model (SIM) over a 2-dimensional sqrt {{n}}times sqrt {{n}} grid. The initial spin configuration {X}{0} serves as the user-controlled input. The output configuration {X}{{t}} is produced by running t steps of Glauber dynamics. Our main goal is to evaluate the information capacity {I}{{n}}({t}):=max {{p}{{X}{0}}}{I}({X}{0};{X}{{t}}) when time t scales with the system's size n. While the positive (but low) temperature regime is our main interest, we start by exploring the simpler zero-temperature dynamics. We first show that at zero temperature, order of sqrt {{n}} bits can be stored in the system indefinitely by coding over stable, striped configurations. While sqrt {{n}} is order optimal for infinite time, backing off to {t}< infty , higher orders of {I}{{n}}({t}) are achievable. First, via linear coding arguments imply we show that {I}{{n}}({t}) = Theta ({n}) for {t}={O}({n}). To go beyond the linear scale, we develop a droplet-based achievability scheme that reliably stores Omega left ({{n}/log {n}}right) for {t}={O}({n}log {n}) time ( log {n} can be replaced with any {o}({n}) function). Moving to the positive but low temperature regime, two main results are provided. First, we show that an initial configuration drawn from the Gibbs measure cannot retain more than a single bit for {t}geq exp ({C}beta {n}{1/4+epsilon }) time. On the other hand, when scaling time with the inverse temperature beta , the stripe-based coding scheme (that stores for infinite time at zero temperature) is shown to retain its bits for {e}{{c}beta }.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TIT.2020.3049028
