5 search results - page 1 / 1 » Lower Bounds on the Rate-Distortion Function of Individual L... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract-- We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function wh...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
DCC
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...