Two new mean codeword lengths L (α, β) and L (β) are defined and it is shown that these
lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently …

The expected codeword length L UD of the best uniquely decodable (UD) code satisfies H
(P; Q)≤ L UD< H (P; Q)+ 1, where H (P; Q) is the Kerridge inaccuracy. By applying the idea …

ABSTRACT A source code C is considered containing K codewords with lengths wi, 1≤ i≤
K, respectively, where K is a non negative integer. The capacity C of a source code is …

A short note on exponentiated mean codeword length for the best!: 1 code Page 109 Mat. Aplic.
Comp., W. 3, n 2, pp. 199a 204, 1984 © Editora Campus Ltda., Rio de Janeiro, RJ, impresso no …

Bounds on the size of a code Page 1 Bounds on the Size of a Code Thomas Ericson
Department of Electrical Engineering, LinkSping University S-582 62 Link~ping, Sweden …

For the case in which the code alphabet consists of M letters, we derive the optimum
probability distribution of a discrete source that assures the minimum average codeword …

The objective of the present communication is to develop new genuine exponentiated mean
codeword lengths and to study deeply the problem of correspondence between well known …

A simple proof of the improved Johnson bound for binary codes - 대한수학회보 - 대한수학회 :
논문 - DBpia 메뉴 건너뛰기 DBpia 전체 search 검색하기 상세검색 최근 검색 키워드가 없습니다 …

A tight upper bound on the redundancy r of Huffman codes, in terms of the minimum
codeword length l, l≥ 1, is provided. The bound is a strictly decreasing function of l. For …

Let A (n, 2 δ, w) denote the maximum number of codewords in any binary code of length n,
constant weight w, and Hamming distance 2 δ Several lower bounds for A (n, 2 δ, w) are …