Zobrazeno 1 - 10
of 228
pro vyhledávání: '"Kraft's inequality"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Peter Harremoës
Publikováno v:
Entropy, Vol 19, Iss 5, p 206 (2017)
Logarithmic score and information divergence appear in information theory, statistics, statistical mechanics, and portfolio theory. We demonstrate that all these topics involve some kind of optimization that leads directly to regret functions and suc
Externí odkaz:
https://doaj.org/article/7fb6f50855044aeb97e377ff316ff0a0
Publikováno v:
Asian Journal of Fuzzy and Applied Mathematics. 7
 In this research article, a new two parametric measure of Entropy  and its corresponding code word length  has been developed. The developed measures are the generalizations to some well known existing measures. Besides, some noiseless coding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa19974609c88a97f7107ff2271cc8f1
https://doi.org/10.24203/ajfam.v7i3.6029
https://doi.org/10.24203/ajfam.v7i3.6029
Autor:
Wojciech Szpankowski
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AI,..., Iss Proceedings (2008)
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating funct
Externí odkaz:
https://doaj.org/article/e3dea827bb1e4674bfda16d6fd65d70e
Publikováno v:
Theoretical Computer Science. 679:107-117
The prefix distance between strings x and y is the number of symbol occurrences in the strings that do not belong to the longest common prefix of x and y. The suffix and the substring distances are defined analogously in terms of the longest common s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9209b9cc28586250fe70c6488d689e37
https://doi.org/10.1016/j.tcs.2016.05.018
https://doi.org/10.1016/j.tcs.2016.05.018
Publikováno v:
IEEE Transactions on Information Theory. 63:2357-2375
In this paper, we address the problem of the universal coding of natural numbers. A new numeration system is introduced, which is based on variable- $r$ meta-Fibonacci sequences and it is a generalization of the Zeckendorf numeration system. This new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71055f2ef61ea10795c0f3ec57e6e921
https://doi.org/10.1109/tit.2017.2663433
https://doi.org/10.1109/tit.2017.2663433
Publikováno v:
AIMS Medical Science, Vol 4, Iss 3, Pp 261-273 (2017)
The prefix array was apparently first computed and used algorithmically in 1984, playing a pivotal role in an optimal algorithm to determine all the tandem repeats in a given (DNA or protein) sequence. However, it is especially since the turn of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5e325c86af1193dc7f0ba0f05fda24e
https://doi.org/10.3934/medsci.2017.3.261
https://doi.org/10.3934/medsci.2017.3.261
Publikováno v:
Theoretical Computer Science. 659:1-13
A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63a01fdf2a63583d6e0de86ed551afc
https://doi.org/10.1016/j.tcs.2016.10.015
https://doi.org/10.1016/j.tcs.2016.10.015