57 search results - page 1 / 12 » A functional view of upper bounds on codes |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
TIT
2002
13 years 10 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 ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
DCC
2008
IEEE
14 years 5 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...
DCC
2006
IEEE
14 years 10 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...