Sciweavers

1184 search results - page 9 / 237
» Algorithmic Results in List Decoding
Sort
View
JSAT
2008
122views more  JSAT 2008»
14 years 11 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
IACR
2011
141views more  IACR 2011»
13 years 11 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
VTC
2007
IEEE
15 years 6 months ago
Fast and Area-Efficient Sphere Decoding Using Look-Ahead Search
— Sphere decoding enables maximum likelihood (ML) detection with fairly low complexity in the MIMO wireless systems, but it takes hundreds cycles at low SNR environment. This pap...
Se-Hyeon Kang, In-Cheol Park
VLSISP
2010
140views more  VLSISP 2010»
14 years 10 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
15 years 12 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra