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

共 8 条

[1] [Anonymous], 1991, ELEMENTS INFORM THEO
[2] ESMAEILI M, 2008, CONT ENG SCI, V1, P169
[3] ESMAEILI M, 2006, P IEEE ICC JUN, P1611
[4] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES
HUFFMAN, DA
[J]. PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09): : 1098 - 1101
[5] The minimum average code for finite memoryless monotone sources
Khosravifard, Mohammadali
Saidi, Hossein
Esmaeili, Morteza
Gulliver, T. Aaron
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) : 955 - 975
[6] MOHAJER S, 2008, P 42 ANN C INF SCI S
[7] Munteanu V., 2007, ELEMENTS INFORM THEO
[8] Munteanu V, 2007, ISSCS 2007: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, P493

← 1 →