|
|
Семинар Добрушинской лаборатории Высшей школы современной математики МФТИ
22 марта 2022 г. 16:00, онлайн, Москва
|
 |
|
 |
|
|
|
Recoverable systems (storage codes on graphs)
А. М. Баргab
a University of Maryland
b Институт проблем передачи информации им. А.А. Харкевича Российской академии наук, г. Москва
|
| Количество просмотров: |
| Эта страница: | 160 |
|
Аннотация:
Consider a shift invariant measure $\mu$ on the set of infinite sequences
$X$
over a finite alphabet $Q$. Call $\mu$ epsilon-recoverable if the entropy of
$\xi$ conditional on its neighborhood is at most epsilon. What can be said
about the measure with maximum entropy $h(\mu)$? We establish
characterizations
of entropy maximizing recoverable measures. The deterministic version of
this problem is closely related to constrained systems, and we discuss
several results based on this link. Finally, we mention some capacity
results
for deterministic systems without assuming shift invariance, and also for
the version of this problem for finite graphs. The talk is based on several
recent papers with a number of coauthors including Ohad Elishco (Beer Sheva)
and Gilles Zemor (Bordeaux).
Zoom-подключение см. на сайте семинара:
http://iitp.ru/ru/userpages/74/285.htm
|
|
Обратная связь: