Sciweavers

32 search results - page 6 / 7
» Bounds on the performance of belief propagation decoding
Sort
View
ICDCS
2010
IEEE
15 years 3 months ago
LT Network Codes
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...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
ISITA
2010
14 years 9 months ago
Information reconciliation for QKD with rate-compatible non-binary LDPC codes
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...
Kenta Kasai, Ryutaroh Matsumoto, Kohichi Sakaniwa
TIT
2008
127views more  TIT 2008»
14 years 11 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
JSAC
2006
97views more  JSAC 2006»
14 years 11 months ago
Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks
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...
Yonghui Li, Branka Vucetic, Tan F. Wong, Mischa Do...
TSP
2011
170views more  TSP 2011»
14 years 6 months ago
Low-Delay Prediction- and Transform-Based Wyner-Ziv Coding
—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...
Xuechen Chen, Ertem Tuncel