Minimax codes for finite alphabets (Corresp.)
J Rissanen - IEEE Transactions on Information Theory, 1978 - ieeexplore.ieee.org
Minimax codes are designed for applications where the symbol probabilities are not known
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …
Optimal codebooks from binary codes meeting the Levenshtein bound
C Xiang, C Ding, S Mesnager - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
In this paper, a generic construction of codebooks based on binary codes is introduced. With
this generic construction, a few previous constructions of optimal codebooks are extended …
this generic construction, a few previous constructions of optimal codebooks are extended …
Weight distribution of cosets of small codes with good dual properties
L Bazzi - IEEE Transactions on Information Theory, 2015 - ieeexplore.ieee.org
The bilateral minimum distance of a binary linear code is the maximum d such that all
nonzero codewords have weights between d and nd. Let Q⊂{0, 1} n be a binary linear code …
nonzero codewords have weights between d and nd. Let Q⊂{0, 1} n be a binary linear code …
On the Svanstrom bound for ternary constant-weight codes
FW Fu, T Klove, Y Luo, VK Wei - IEEE Transactions on …, 2001 - ieeexplore.ieee.org
On the Svanstrom bound for ternary constant-weight codes Page 1 IEEE TRANSACTIONS
ON INFORMATION THEORY, VOL. 47, NO. 5, JULY 2001 2061 We have a [[2t(8 t 01); 2tm 0; …
ON INFORMATION THEORY, VOL. 47, NO. 5, JULY 2001 2061 We have a [[2t(8 t 01); 2tm 0; …
On the information function of an error-correcting code
T Helleseth, T Klove… - IEEE Transactions on …, 1997 - ieeexplore.ieee.org
The information function e/sub h/of a code is the average amount of information contained in
h positions of the codewords. Upper and lower bounds on the information function of binary …
h positions of the codewords. Upper and lower bounds on the information function of binary …
On the cost of worst case coding length constraints
We investigate the redundancy that arises from adding a worst case length constraint to
uniquely decodable fixed-to-variable codes over achievable Huffman (1952) codes. This is …
uniquely decodable fixed-to-variable codes over achievable Huffman (1952) codes. This is …
Improved upper bound for the redundancy of fix-free codes
S Yekhanin - IEEE transactions on information theory, 2004 - ieeexplore.ieee.org
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other
codeword. In a fix-free code, any finite sequence of codewords can be decoded in both …
codeword. In a fix-free code, any finite sequence of codewords can be decoded in both …
A simple upper bound on the redundancy of Huffman codes
C Ye, RW Yeung - IEEE Transactions on Information Theory, 2002 - ieeexplore.ieee.org
Upper bounds on the redundancy of Huffman codes have been extensively studied in the
literature. Almost all of these bounds are in terms of the probability of either the most likely or …
literature. Almost all of these bounds are in terms of the probability of either the most likely or …
A short note on the redundancy of degree α
IJ Taneja - Information sciences, 1986 - Elsevier
It is known that there always exists an instantaneous, uniquely decodable code such that the
redundancy of the discrete source is bounded between 0 and 1. Johnsen [5] provided …
redundancy of the discrete source is bounded between 0 and 1. Johnsen [5] provided …
A lower bound on list size for list decoding
V Guruswami, S Vadhan - IEEE Transactions on Information …, 2010 - ieeexplore.ieee.org
A q-ary error-correcting code C⊆{1, 2,..., q} n is said to be list decodable to radius ρ with list
size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in …
size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in …