OPTIMUM 1-ENDED BINARY PREFIX CODES

被引：0
|
作者：
BERGER, T
YEUNG, R
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 311卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：68 / 75
页数：8
相关论文
共 50 条
  • [21] FURTHER RESULTS ON BINARY CONVOLUTIONAL CODES WITH AN OPTIMUM DISTANCE PROFILE
    JOHANNESSON, R
    PAASKE, E
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (02) : 264 - 268
  • [22] A FAMILY OF CODES COMMUTATIVELY EQUIVALENT TO PREFIX CODES
    MAUCERI, S
    RESTIVO, A
    [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 1 - 4
  • [23] Almost all complete binary prefix codes have a self-synchronizing string
    Freiling, CF
    Jungreis, DS
    Théberge, F
    Zeger, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (09) : 2219 - 2225
  • [24] COMPLEXITY OF ACCEPTORS FOR PREFIX CODES
    BROWN, DJ
    ELIAS, P
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (03) : 357 - 359
  • [25] STRUCTURE OF SYSTEMATIC PREFIX CODES
    LASSEZ, JL
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1972, 3 (2-3) : 177 - 188
  • [26] Bit recycling with prefix codes
    Dube, Danny
    Beaudoin, Vincent
    [J]. DCC 2007: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2007, : 379 - 379
  • [27] Fast and Compact Prefix Codes
    Gagie, Travis
    Navarro, Gonzalo
    Nekrich, Yakov
    [J]. SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 419 - +
  • [28] PREFIX CODES, TREES, AND AUTOMATA
    LASSEZ, JL
    [J]. INFORMATION SCIENCES, 1975, 8 (02) : 155 - 171
  • [29] EFFICIENT DECODING OF PREFIX CODES
    HIRSCHBERG, DS
    LELEWER, DA
    [J]. COMMUNICATIONS OF THE ACM, 1990, 33 (04) : 449 - 459
  • [30] Prefix Codes for Power Laws
    Baer, Michael B.
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2464 - 2468
12345