73 search results - page 1 / 15 » Low density codes achieve the rate-distortion bound |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a...
TIP
2010
13 years 3 months ago
2010
—Motion scalability is designed to improve the coding efficiency of a scalable video coding framework, especially in the medium to low range of decoding bit rates and spatial re...
TIT
2002
13 years 4 months ago
2002
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...