Sciweavers

1016 search results - page 103 / 204
» Linear error-block codes
Sort
View
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 2 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
TIT
2002
90views more  TIT 2002»
13 years 7 months ago
Optimal sequences for CDMA under colored noise: A Schur-saddle function property
We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We con...
Pramod Viswanath, Venkat Anantharam
VLSISP
2002
103views more  VLSISP 2002»
13 years 7 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 3 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
SIAMDM
2011
13 years 2 months ago
Origins of Nonlinearity in Davenport-Schinzel Sequences
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
Seth Pettie