The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. T

five papers( transactions and review)talking about the propagation channel: canal1: Modeling of Wide-Band MIMO Radio Channels Based on NLoS Indoor Measurements. canal2: Reliable Channel Regions for Good Binary Codes Transmitted Over Parallel Chan

e binary erasure channel (BEC) is perhaps the simplest non-trivial channelmodel imaginable. It was introduced by Elias as a toy example in #$ &. e emergence of the internet promoted the erasure channel into the class of “real world” channels.

Kite codes, which were originally defined over the binary field, are generalized to arbitrary abelian groups in this paper. Kite codes are a special class of prefix rateless codes over groups, which can generate potentially infinite (or as many