Self-Organising Lists
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Jossy Sayir.
Self organising lists are used in data compression to substitute a source with an unknown alphabet with an ordered monotone non-increasing probability mass function. I will explain how they works, and define a number of properties that we would like to prove about them. I will show which of those properties have been proved and which are still open problems.
This talk is part of the Communications Research Group Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|