24 citations · 111 across the 26 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2024
Equal Requests are Asymptotically Hardest for Data Recovery
Jüri Lember, Ago-Erik Riet
In a distributed storage system serving hot data, the data recovery performance becomes important, captured e.g. by the service rate. We give partial evidence for it being hardest…
cs.IT2021★ 10 cited
Regenerativity of Viterbi process for pairwise Markov models
Jüri Lember, Joonas Sova
For hidden Markov models one of the most popular estimates of the hidden chain is the Viterbi path -- the path maximising the posterior probability. We consider a more general sett…
cs.IT2015★ 2 cited
New Bounds for Permutation Codes in Ulam Metric
Faruk Göloğlu, Jüri Lember, Ago-Erik Riet +1
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Single…