О сравнении недоопределённых алфавитов
Published in Прикладная дискретная математика. Приложение • Jan 1, 2014
Authors:
Шоломов Лев Абрамович
Abstract
For underdetermined alphabets, the following two concepts are defined: (a) one alphabet is stronger than another, and (b) two alphabets have equal strength. In case (b), a solution of an optimal compression problem for one of the alphabets in fact is a solution of the same problem for the other. To ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!