Information Quantities Attached to M-ary Antiuniform Huffman Codes

被引：0
|
作者：
Munteanu, Valeriu [1 ]
Tarniceriu, Daniela [1 ]
Zaharia, Gheorghe [2 ]
机构：
[1] Tech Univ Gheorghe Asachi Iasi, Fac Elect Telecommun & Informat Technol, Iasi, Romania
[2] CNRS, UMR, INSA IETR, F-75700 Paris, France
来源：
ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, | 2009年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.
引用
收藏
页码：549 / +
页数：2
相关论文
共 50 条
  • [31] A NOTE ON D-ARY HUFFMAN CODES
    CAPOCELLI, RM
    DESANTIS, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) : 174 - 179
  • [32] MAXIMUM-WEIGHT GROUP CODES FOR THE BALANCED M-ARY CHANNEL
    HELSTROM, CW
    IRE TRANSACTIONS ON INFORMATION THEORY, 1960, 6 (05): : 550 - 555
  • [33] Shannon capacity of M-ary redundant multitrack runlength limited codes
    Vasic, BV
    McLaughlin, SW
    Milenkovic, O
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) : 766 - 774
  • [34] Optimal block codes for M-ary Runlength-constrained channels
    Datta, S
    McLaughlin, SW
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) : 2069 - 2078
  • [35] Five runlength-limited codes for M-ary recording channels
    McLaughlin, SW
    IEEE TRANSACTIONS ON MAGNETICS, 1997, 33 (03) : 2442 - 2450
  • [36] BINARY CODES FROM m-ARY n-CUBES Qnm
    Key, Jennifer D.
    Rodrigues, Bernardo G.
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2021, 15 (03) : 507 - 524
  • [37] DECODING M-ARY LINEAR CODES WITH THE QUANTUM APPROXIMATE OPTIMIZATION ALGORITHM
    Epelde, M.
    Combarro, E. F.
    Rua, I. F.
    EURASIAN JOURNAL OF MATHEMATICAL AND COMPUTER APPLICATIONS, 2022, 10 (01): : 4 - 25
  • [38] Algorithm for joint decoding of turbo codes and M-ary orthogonal modulation
    Liang, PCP
    Stark, WE
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 191 - 191
  • [39] Simulation results for permutation trellis codes using M-ary FSK
    Swart, TG
    de Beer, I
    Ferreira, HC
    Vinck, AJH
    2005 INTERNATIONAL SYMPOSIUM ON POWER LINE COMMUNICATIONS AND ITS APPLICATIONS, 2005, : 317 - 321
  • [40] ON LEVEL-WEIGHT STUDIES OF BINARY AND M-ARY GRAY CODES
    SHARMA, BD
    KHANNA, RK
    INFORMATION SCIENCES, 1980, 21 (02) : 179 - 186
12345