48213

Автор(ы): 

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Доклад

Название: 

On Calculating the Entropy of 2D words over a Finite Alphabet

ISBN/ISSN: 

13: 978-1-5386-5589-4

DOI: 

10.1109/EnT.2018.00025

Наименование конференции: 

  • International Conference on Engineering Technologies and Computer Science (EnT 2018, Moscow)

Наименование источника: 

  • Proseedings of the International Conference on Engineering Technologies and Computer Science (EnT 2018, Moscow)

Город: 

  • Danvers

Издательство: 

  • IEEE

Год издания: 

2018

Страницы: 

82–85
Аннотация
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.

Библиографическая ссылка: 

Ульянов М.В., Сметанин Ю.Г., Шульга М.М. On Calculating the Entropy of 2D words over a Finite Alphabet / Proseedings of the International Conference on Engineering Technologies and Computer Science (EnT 2018, Moscow). Danvers: IEEE, 2018. С. 82–85 .