On Calculating the Entropy of 2D Words Over a Finite Alphabet

The objects of the article are finite 2D words over a finite alphabet. An efficient method for calculating the entropy function of 2D words is proposed. The algorithm adapts the window size. Possible applications of the entropy of finite 2D words in various domains are considered. Some recommendations concerning the choice of efficient policies of configuration storage.