62 search results - page 1 / 13 » Improved Upper Bound for the Redundancy of Fix-Free Codes |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
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 d...
TIT
2011
12 years 12 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
TIT
2008
13 years 5 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
TIT
2002
13 years 4 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....