Sciweavers

45 search results - page 4 / 9
» Limits to List Decoding Random Codes
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 11 months ago
High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
Somsak Kittipiyakul, Petros Elia, Tara Javidi
TIT
2008
122views more  TIT 2008»
14 years 11 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
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 ...
Michael Chertkov, Mikhail G. Stepanov
TIT
2010
136views Education» more  TIT 2010»
14 years 6 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
INFOCOM
2009
IEEE
15 years 6 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
TIT
2002
75views more  TIT 2002»
14 years 11 months ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire