19 search results - page 1 / 4 » On the Characterization of Linear Uniquely Decodable Codes |
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
TIT
2008
13 years 4 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...