We apply Renormalization Group (RG) techniques to Classical Information Theory, in the limit of large codeword size $n$. In particular, we apply RG techniques to (1) noiseless coding (i.e., a coding used for compression) and (2) noisy coding (i.e., a coding used for channel transmission). Shannon's "first" and "second" theorems refer to (1) and (2), respectively. Our RG technique uses composition class (CC) ideas, so we call our technique Composition Class Renormalization Group (CCRG). Often, CC's are called "types" instead of CC's, and their theory is referred to as the "Method of Types". For (1) and (2), we find that the probability of error can be expressed as an Error Function whose argument contains variables that obey renormalization group equations. We describe a computer program called WimpyRG-C1.0 that implements the ideas of this paper. C++ source code for WimpyRG-C1.0 is publicly available.
Renormalization-Inspired Effective Field Neural Networks for Scalable Modeling of Classical and Quantum Many-Body Systems
Department of Physics, Hong Kong University of Science and Technology(香港科技大学物理系);Department of Physics and Astronomy, University of Tennessee, Knoxville, TN 37996, USA(田纳西大学 Knoxville 分校物理与天文学系);Min H. Kao Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, Tennessee 37996, USA(田纳西大学 Knoxville 分校 Min H. Kao 电子工程与计算机科学系)
Augmenting Density Matrix Renormalization Group with Matchgates and Clifford circuits
Shanghai Jiao Tong University(上海交通大学);Tsung-Dao Lee Institute, Shanghai Jiao Tong University(上海交大李政道研究所);Beijing Normal University(北京师范大学);Hefei National Laboratory(合肥国家实验室)