TY - GEN
T1 - Information Storage in the Stochastic Ising Model at Low Temperature
AU - Goldfeld, Ziv
AU - Bresler, Guy
AU - Polyanskiy, Yury
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7/1
Y1 - 2019/7/1
N2 - 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 × \sqrt n grid. The measure of interest is the information capacity {I-n}\left(t\right) \triangleq {\max -{{p-{{X-0}}}}}I\left({{X-0};{X-t}}\right), where the initial spin configuration X0 is a user-controlled input and the output configuration Xt 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 X0 is drawn according to the Gibbs measure, then I(X0; Xt) ≤ 1 + o(1) for t \geq \exp \left({c{n^{\frac{1}{4} + \varepsilon }}}\right). On the other hand, when scaling time with β, we propose a stripe-based coding scheme that stores order of \sqrt n bits for exp(β) 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 striped-based storage scheme constitute initial steps towards a general analysis of In(t) for β > 0.
AB - 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 × \sqrt n grid. The measure of interest is the information capacity {I-n}\left(t\right) \triangleq {\max -{{p-{{X-0}}}}}I\left({{X-0};{X-t}}\right), where the initial spin configuration X0 is a user-controlled input and the output configuration Xt 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 X0 is drawn according to the Gibbs measure, then I(X0; Xt) ≤ 1 + o(1) for t \geq \exp \left({c{n^{\frac{1}{4} + \varepsilon }}}\right). On the other hand, when scaling time with β, we propose a stripe-based coding scheme that stores order of \sqrt n bits for exp(β) 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 striped-based storage scheme constitute initial steps towards a general analysis of In(t) for β > 0.
UR - http://www.scopus.com/inward/record.url?scp=85073155903&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849513
DO - 10.1109/ISIT.2019.8849513
M3 - Conference contribution
AN - SCOPUS:85073155903
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 732
EP - 736
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
Y2 - 7 July 2019 through 12 July 2019
ER -