58 search results - page 3 / 12 » Lower Bounds on the Rate-Distortion Function of LDGM Codes |
111
click to vote
TIT
2008
15 years 1 months ago
2008
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
118
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
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 o...
123
click to vote
MOBIHOC
2012
ACM
13 years 3 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...