94 search results - page 9 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
TIT
2002
13 years 7 months ago
2002
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
ECCC
2011
12 years 11 months ago
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
AAMAS
1999
Springer
13 years 7 months ago
1999
Springer
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
ALP
1994
Springer
14 years 4 days ago
1994
Springer
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...