164 search results - page 24 / 33 » Improved upper bounds on sizes of codes |
100
click to vote
STOC
2006
ACM
15 years 9 months ago
2006
ACM
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 ...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
97
Voted
SCOPES
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
IH
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...