Precise minimax redundancy for Markov sources

被引：0
|
作者：
Jacquet, P [1 ]
Szpankowski, W [1 ]
机构：
[1] INRIA, F-78150 Le Chesnay, France
来源：
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 2003年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：78 / 78
页数：1
相关论文
共 50 条
  • [1] Markov types and minimax redundancy for Markov sources
    Jacquet, P
    Szpankowski, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (07) : 1393 - 1402
  • [2] A combinatorial problem arising in information theory: Precise minimax redundancy for Markov sources
    Jacquet, P
    Szpankowski, W
    MATHEMATICS AND COMPUTER SCIENCE II: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2002, : 311 - 328
  • [3] The precise minimax redundancy
    Drmota, M
    Szpankowski, W
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 35 - 35
  • [4] Precise minimax redundancy and regret
    Drmota, M
    Szpankowski, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (11) : 2686 - 2707
  • [5] Minimax redundancy for the class of memoryless sources
    Xie, Q
    Barron, AR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) : 646 - 657
  • [6] Minimax redundancy for Markov chains with large state space
    Tatwawadi, Kedar
    Jiao, Jiantao
    Weissman, Tsachy
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 216 - 220
  • [7] MINIMAX NOISELESS UNIVERSAL CODING FOR MARKOV SOURCES
    DAVISSON, LD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 211 - 215
  • [8] Average Redundancy of the Shannon Code for Markov Sources
    Merhav, Neri
    Szpankowski, Wojciech
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) : 7186 - 7193
  • [9] Average Redundancy of the Shannon Code for Markov Sources
    Merhav, Neri
    Szpankowski, Wojciech
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1919 - +
  • [10] MINIMAX UNIVERSAL NOISELESS CODING FOR UNIFILAR AND MARKOV SOURCES
    BLUMER, AC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (06) : 925 - 930
12345