110 search results - page 13 / 22 » Patterson-Wiedemann construction revisited |
STACS
2005
Springer
14 years 29 days ago
2005
Springer
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
TIT
2010
13 years 2 months ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
ISPW
2009
IEEE
14 years 2 months ago
2009
IEEE
It is usual for work completed at one point in a software development process to be revisited, or reworked, at a later point. Such rework is informally understood, but if we hope t...
AUTOMATICA
2006
13 years 7 months ago
2006
We consider a class of systems with a cyclic interconnection structure that arises, among other examples, in dynamic models for certain biochemical reactions. We first show that a...