111 search results - page 7 / 23 » The Complexity of Local List Decoding |
166
Voted
TCOM
2010
15 years 4 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
140
click to vote
EMNLP
2009
15 years 3 months ago
2009
Recent syntactic extensions of statistical translation models work with a synchronous context-free or tree-substitution grammar extracted from an automatically parsed parallel cor...
250
Voted
GLOBECOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...
140
click to vote
ECCC
2010
15 years 5 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
142
Voted
ATVA
2004
Springer
15 years 11 months ago
2004
Springer
We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference o...