Sciweavers

437 search results - page 57 / 88
» Randomized Lattice Decoding
Sort
View
JCT
2010
83views more  JCT 2010»
15 years 24 days ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
MABS
2000
Springer
15 years 6 months ago
Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems
The effects of distinct agent interaction and activation structures are compared and contrasted in several multi-agent models of social phenomena. Random graphs and lattices repre...
Robert L. Axtell
114
Voted
TIT
2010
81views Education» more  TIT 2010»
14 years 9 months ago
Generalizing capacity: new definitions and capacity theorems for composite channels
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
Michelle Effros, Andrea J. Goldsmith, Yifan Liang
TIT
2010
136views Education» more  TIT 2010»
14 years 9 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
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
16 years 2 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman