124 search results - page 12 / 25 » tit 2002 |
TIT
2002
13 years 10 months ago
2002
A code is -quasi-cyclic ( -QC) if there is an integer such that cyclic shift of a codeword by -positions is also a codeword. For = 1, cyclic codes are obtained. A dyadic code is a ...
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 ...
TIT
2002
13 years 10 months ago
2002
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
TIT
2002
13 years 10 months ago
2002
We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the tradeoff. Using a natural distortion measure based on en...
TIT
2002
13 years 10 months ago
2002
Abstract--We study frames for robust transmission over the Internet. In our previous work, we used quantized finite-dimensional frames to achieve resilience to packet losses; here,...