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 ...
David Burshtein, Michael Krivelevich, Simon Litsyn...
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
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...
We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to success...
Suhas N. Diggavi, N. J. A. Sloane, Vinay A. Vaisha...
Abstract--Irreducible cyclic codes have been an interesting subject of study for many years. The weight distribution of some of them have been determined. In this paper, we determi...
Cunsheng Ding, Tor Helleseth, Harald Niederreiter,...