A UNIVERSAL ALGORITHM FOR HOMOPHONIC CODING

被引：0
作者：
GUNTHER, CG
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 330卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：405 / 414
页数：10
相关论文
共 50 条
  • [21] Universal prediction and universal coding
    Suzuki, Joe
    Systems and Computers in Japan, 2003, 34 (06) : 1 - 11
  • [22] An efficient universal coding algorithm for noiseless channel with symbols of unequal cost
    Iwata, K
    Morii, M
    Uyematsu, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (11): : 2232 - 2237
  • [23] Separable Karhunen Loeve Transforms for the weighted universal transform coding algorithm
    Feng, HY
    Effros, M
    ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI, 1999, : 2435 - 2438
  • [24] Efficient universal coding algorithm for noiseless channel with symbols of unequal cost
    Univ of Tokushima, Tokushima-shi, Japan
    IEICE Trans Fund Electron Commun Comput Sci, 11 (2232-2237):
  • [25] Bayes universal coding algorithm for side information context tree models
    Matsushima, T
    Hirasawa, S
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2345 - 2348
  • [26] A homophonic DES
    Hsieh, TM
    Yeh, YS
    Hsieh, YC
    Wang, CC
    INFORMATION PROCESSING LETTERS, 1998, 66 (06) : 317 - 320
  • [27] HOMOPHONIC PREJUDICES
    Garcia-Carpintero, Manuel
    CRITICA-REVISTA HISPANOAMERICANA DE FILOSOFIA, 2008, 40 (120): : 67 - 84
  • [28] UNIVERSAL NOISELESS CODING
    DAVISSON, LD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) : 783 - 795
  • [29] Universal anytime coding
    Draper, Stark C.
    Sahai, Anant
    2007 5TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1-2, 2007, : 646 - 650
  • [30] Hierarchical universal coding
    Feder, M
    Merhav, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1354 - 1364
12345