32 search results - page 6 / 7 » Bounds on the performance of belief propagation decoding |
74
Voted
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
ISITA
2010
14 years 7 months ago
2010
We study information reconciliation (IR) scheme for the quantum key distribution (QKD) protocols. The IR for the QKD can be considered as the asymmetric Slepian-Wolf problem, which...
87
Voted
TIT
2008
14 years 9 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
JSAC
2006
14 years 9 months ago
2006
It has been shown that distributed turbo coding (DTC) can approach the capacity of a wireless relay network. In the existing DTC schemes, it is usually assumed that error-free deco...
TSP
2011
14 years 4 months ago
2011
—This paper studies low-delay Wyner–Ziv coding, i.e., lossy source coding with side information at the decoder, with emphasis on the extreme of zero delay. To achieve zero dela...